Sciweavers

2089 search results - page 16 / 418
» Finding Environment Guarantees
Sort
View
108
Voted
CORR
2004
Springer
111views Education» more  CORR 2004»
15 years 1 months ago
Finding Approximate Palindromes in Strings Quickly and Simply
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
L. Allison
OSDI
2008
ACM
16 years 2 months ago
From Optimization to Regret Minimization and Back Again
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
Ioannis C. Avramopoulos, Jennifer Rexford, Robert ...
101
Voted
EDBT
2008
ACM
125views Database» more  EDBT 2008»
16 years 2 months ago
On the brink: searching for drops in sensor data
Sensor networks have been widely used to collect data about the environment. When analyzing data from these systems, people tend to ask exploratory questions--they want to find su...
Gong Chen, Junghoo Cho, Mark H. Hansen
166
Voted
AWPN
2008
272views Algorithms» more  AWPN 2008»
15 years 3 months ago
Finding Cost-Efficient Adapters
When adapting services in a SOA environment, not only the validity of the adapter may be of importance, but also non-functional properties like the costs of the adapter. We introdu...
Christian Gierds
ICRA
2003
IEEE
129views Robotics» more  ICRA 2003»
15 years 7 months ago
Optimal navigation and object finding without geometric maps or localization
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
Benjamín Tovar, Steven M. LaValle, Rafael M...