Sciweavers

101 search results - page 15 / 21
» Domination Problems in Nowhere-Dense Classes
Sort
View
COMPGEOM
2009
ACM
14 years 1 months ago
A general approach for cache-oblivious range reporting and approximate range counting
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
ECCV
2010
Springer
14 years 21 days ago
Maximum Margin Distance Learning for Dynamic Texture Recognition
The range space of dynamic textures spans spatiotemporal phenomena that vary along three fundamental dimensions: spatial texture, spatial texture layout, and dynamics. By describin...
WINE
2009
Springer
128views Economy» more  WINE 2009»
14 years 1 months ago
Sequential Bidding in the Bailey-Cavallo Mechanism
Abstract. We are interested in mechanisms that maximize social welfare. In [2] this problem was studied for multi-unit auctions and for public project problems, and in each case so...
Krzysztof R. Apt, Evangelos Markakis
INFOCOM
2005
IEEE
14 years 29 days ago
Power aware routing for sensor databases
— Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures...
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash ...
SOFSEM
2000
Springer
13 years 11 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt