Sciweavers

575 search results - page 68 / 115
» A Spectral Approach to Lower Bounds
Sort
View
90
Voted
AAAI
2010
15 years 2 months ago
Can Approximation Circumvent Gibbard-Satterthwaite?
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
Ariel D. Procaccia
99
Voted
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
15 years 2 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
94
Voted
RSS
2007
115views Robotics» more  RSS 2007»
15 years 2 months ago
An experimental study of exploiting multipath fading for robot communications
— A simple approach for mobile robots to exploit multipath fading in order to improve received radio signal strength (RSS), is presented. The strategy is to sample the RSS at dis...
Magnus Lindhé, Karl Henrik Johansson, Anton...
PUK
2000
15 years 2 months ago
Heuristic Search Planning with BDDs
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
Stefan Edelkamp
95
Voted
CAS
2008
118views more  CAS 2008»
15 years 23 days ago
A Novel Method for Measuring the Structural Information Content of Networks
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
Matthias Dehmer