3466 search results - page 280 / 694 » Fast computation of special resultants |
177
click to vote
AINA
2006
IEEE
15 years 10 months ago
2006
IEEE
Ad hoc networks are dynamic networks formed "on the fly" by a set of nodes. Achieving secure routing in such networks is a big challenge. Asymmetric signature schemes pr...
159
click to vote
AAAI
2000
15 years 8 months ago
2000
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously ...
209
click to vote
WIOPT
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
195
click to vote
ICIG
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we present an efficient and robust subspace learning based object tracking algorithm with special illumination handling. Illumination variances pose a great challen...
191
click to vote
CGA
2010
15 years 3 months ago
2010
Developing visualization applications is non-trivial and poses special challenges. This is due to the fact that typical visualization software processes a large amount of data res...