5595 search results - page 929 / 1119 » Approximation Algorithms for Clustering Problems |
210
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
171
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...
187
click to vote
IPSN
2004
Springer
15 years 11 months ago
2004
Springer
Wireless sensor networks are capable of collecting an enormous amount of data over space and time. Often, the ultimate objective is to derive an estimate of a parameter or functio...
126
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
175
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...