329 search results - page 64 / 66 » A note on the Hopf-Stiefel function |
118
click to vote
ICCV
1998
IEEE
15 years 4 months ago
1998
IEEE
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...
118
click to vote
COCOON
1998
Springer
15 years 3 months ago
1998
Springer
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...
CSL
2006
Springer
15 years 3 months ago
2006
Springer
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...
102
click to vote
SIROCCO
2007
15 years 1 months ago
2007
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...
ACE
2004
15 years 1 months ago
2004
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 ...