Sciweavers

2489 search results - page 478 / 498
» On the Subgroup Distance Problem
Sort
View
ICALP
2004
Springer
14 years 23 days ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
VLDB
2004
ACM
120views Database» more  VLDB 2004»
14 years 22 days ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
ICRA
2003
IEEE
163views Robotics» more  ICRA 2003»
14 years 20 days ago
An experimental study of hybrid switched system approaches to visual servoing
Abstract— In the recent past, many researchers have developed control algorithms for visual servo applications. In this paper, we introduce a new hybrid switched system approach,...
Nicholas R. Gans, Seth Hutchinson
ISPD
2003
ACM
133views Hardware» more  ISPD 2003»
14 years 19 days ago
Optimal minimum-delay/area zero-skew clock tree wire-sizing in pseudo-polynomial time
In 21st-Century VLSI design, clocking plays crucial roles for both performance and timing convergence. Due to their non-convex nature, optimal minimum-delay/area zero-skew wire-si...
Jeng-Liang Tsai, Tsung-Hao Chen, Charlie Chung-Pin...
ATAL
2003
Springer
14 years 19 days ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...