Sciweavers

329 search results - page 64 / 66
» A note on the Hopf-Stiefel function
Sort
View
ICCV
1998
IEEE
14 years 25 days ago
Condensing Image Databases when Retrieval is Based on Non-Metric Distances
One of the key problems in appearance-based vision is understanding how to use a set of labeled images to classify new images. Classification systems that can model human performa...
David W. Jacobs, Daphna Weinshall, Yoram Gdalyahu
COCOON
1998
Springer
14 years 23 days ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
CSL
2006
Springer
14 years 8 days ago
Nonmonotonic Logics and Their Algebraic Foundations
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...
Miroslaw Truszczynski
SIROCCO
2007
13 years 10 months ago
Fast Periodic Graph Exploration with Constant Memory
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...
ACE
2004
186views Education» more  ACE 2004»
13 years 10 months ago
TinkerNet: A Low-Cost Networking Laboratory
The 2002 SIGCOMM Workshop on Educational Challenges for Computer Networking [Kur02a] exposed many issues related to teaching computer networking with the need for a laboratory in ...
Michael Erlinger, Mart Molle, Titus Winters, Chris...