10890 search results - page 1851 / 2178 » Automatic Complexity Analysis |
216
click to vote
CIVR
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
183
click to vote
ER
2003
Springer
15 years 12 months ago
2003
Springer
The integration of heterogeneous legacy databases requires understanding of database structure and content. We previously developed a theoretical and software infrastructure to sup...
198
click to vote
ICMI
2003
Springer
15 years 11 months ago
2003
Springer
Many user interfaces, from graphic design programs to navigation aids in cars, share a virtual space with the user. Such applications are often ideal candidates for speech interfa...
189
click to vote
ISPW
2010
IEEE
15 years 11 months ago
2010
IEEE
Pressures for more complex products, customer dissatisfaction and problems related to cost and schedule overruns increase the need for effective management response and for improve...
195
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...