Sciweavers

203 search results - page 35 / 41
» Improved undecidability results on weighted timed automata
Sort
View
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 11 months ago
Distance Based Indexing for String Proximity Search
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
Jai Macker, Murat Tasan, Süleyman Cenk Sahina...
MOBISYS
2009
ACM
14 years 10 months ago
Leveraging smart phones to reduce mobility footprints
Mobility footprint refers to the size, weight, and energy demand of the hardware that must be carried by a mobile user to be effective at any time and place. The ideal of a zero m...
Stephen Smaldone, Benjamin Gilbert, Nilton Bila, L...
ALGORITHMICA
2011
13 years 4 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
ATAL
2009
Springer
14 years 2 months ago
On fast exploration in 2D and 3D terrains with multiple robots
We present a fast multi-robotic exploration methodology for 2D and 3D terrains. An asynchronous exploration strategy is introduced which shows significant improvements over the ex...
Rahul Sawhney, K. Madhava Krishna, Kannan Srinatha...
FOCS
2010
IEEE
13 years 7 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan