Sciweavers

32 search results - page 2 / 7
» Path coupling without contraction
Sort
View
ECCV
1996
Springer
14 years 7 months ago
Stereo Without Search
Search is not inherent in the correspondence problem. We propose a representation of images, called intrinsic curves, that combines the ideas of associative storage of images with...
Carlo Tomasi, Roberto Manduchi
ASSETS
2005
ACM
13 years 7 months ago
How to operate a PC without using the hands
A demo of a biosignal interface, which allows to operate a Windows r PC without using the hands, shall be given. The system – called HaMCoS (for Hands-free Mouse Control System)...
Torsten Felzer, Rainer Nordmann
JDA
2006
184views more  JDA 2006»
13 years 5 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 5 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
PVLDB
2010
146views more  PVLDB 2010»
13 years 3 months ago
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
Michael Rice, Vassilis J. Tsotras