Sciweavers

2342 search results - page 32 / 469
» Sublinear geometric algorithms
Sort
View
DCG
2010
137views more  DCG 2010»
13 years 10 months ago
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
ATAL
2007
Springer
14 years 4 months ago
Eliciting single-peaked preferences using comparison queries
Voting is a general method for aggregating the preferences of multiple agents. Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alter...
Vincent Conitzer
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 10 months ago
Sharp thresholds For monotone properties in random geometric graphs
Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari
WEA
2007
Springer
120views Algorithms» more  WEA 2007»
14 years 4 months ago
Experimental Study of Geometric t-Spanners: A Running Time Comparison
Mohammad Farshi, Joachim Gudmundsson