Sciweavers

2149 search results - page 61 / 430
» Form over Substance
Sort
View
APPROX
2005
Springer
90views Algorithms» more  APPROX 2005»
15 years 5 months ago
Tight Bounds for String Reconstruction Using Substring Queries
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...
Dekel Tsur
ICRA
2003
IEEE
171views Robotics» more  ICRA 2003»
15 years 5 months ago
Motion planning for multiple mobile robots using dynamic networks
- A new motion planning framework is presented that enables multiple mobile robots with limited ranges of sensing and communication to maneuver and achieve goals safely in dynamic ...
Christopher M. Clark, Stephen M. Rock, Jean-Claude...
VISUAL
1999
Springer
15 years 4 months ago
Similarity Search Using Multiple Examples in MARS
Abstract. Unlike traditional database management systems, in multimedia databases that support content-based retrieval over multimedia objects, it is difficult for users to express...
Kriengkrai Porkaew, Sharad Mehrotra, Michael Orteg...
CCS
1998
ACM
15 years 4 months ago
A Probabilistic Poly-Time Framework for Protocol Analysis
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
Patrick Lincoln, John C. Mitchell, Mark Mitchell, ...
AH
2004
Springer
15 years 3 months ago
Evaluating Information Filtering Techniques in an Adaptive Recommender System
Abstract. With the huge increase in the volume of information available in digital form and the increasing diversity of Web applications, the need for efficient, reliable, informat...
John O'Donovan, John Dunnion