7006 search results - page 377 / 1402 » Approximation Algorithms |
133
click to vote
WINE
2005
Springer
15 years 10 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
193
click to vote
COMGEO
2002
ACM
15 years 4 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
171
Voted
PAMI
2012
13 years 7 months ago
2012
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
128
click to vote
COCO
2006
Springer
15 years 8 months ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
154
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...