Sciweavers

2681 search results - page 101 / 537
» Problem F
Sort
View
113
Voted
ICIP
2008
IEEE
16 years 3 months ago
LASIC: A model invariant framework for correspondence
In this paper we address two closely related problems. The first is the object detection problem, i.e., the automatic decision of whether a given image represents a known object o...
Bernardo Rodrigues Pires, João Xavier, Jos&...
DARS
2000
Springer
141views Robotics» more  DARS 2000»
15 years 6 months ago
Cooperation of Multiple Robots to Solve Maze Tasks
This paper discusses the use of cooperation and distributed intelligence within a robot team to solve a maze problem in which a set of ordered control point tasks has to be perform...
C. R. F. Costa, Eliana P. L. Aude
ICALP
1992
Springer
15 years 6 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
SPAA
2004
ACM
15 years 7 months ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 2 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho