Sciweavers

370 search results - page 67 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View
ATAL
2011
Springer
12 years 7 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
IEAAIE
2005
Springer
14 years 27 days ago
Movement Prediction from Real-World Images Using a Liquid State Machine
Prediction is an important task in robot motor control where it is used to gain feedback for a controller. With such a self-generated feedback, which is available before sensor rea...
Harald Burgsteiner, Mark Kröll, Alexander Leo...
BMCBI
2010
138views more  BMCBI 2010»
13 years 7 months ago
UFFizi: a generic platform for ranking informative features
Background: Feature selection is an important pre-processing task in the analysis of complex data. Selecting an appropriate subset of features can improve classification or cluste...
Assaf Gottlieb, Roy Varshavsky, Michal Linial, Dav...
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 18 days ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
ADHOC
2007
122views more  ADHOC 2007»
13 years 7 months ago
Modeling and analyzing the correctness of geographic face routing under realistic conditions
Geographic protocols are very promising for wireless ad hoc and sensor networks due to the low state storage and low message overhead. Under certain idealized conditions, geograph...
Karim Seada, Ahmed Helmy, Ramesh Govindan