Sciweavers

5055 search results - page 215 / 1011
» Relative Timing
Sort
View

Presentation
955views
14 years 9 days ago
P-Tour: A Personal Navigation System for Tourist
In this paper, we propose a personal navigation system for tourism called P-Tour. When a tourist specifies multiple destinations with relative importance and restrictions on arriva...
NIPS
2004
15 years 7 months ago
Maximising Sensitivity in a Spiking Network
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
Anthony J. Bell, Lucas C. Parra
STACS
2010
Springer
16 years 1 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
GIS
1999
ACM
15 years 10 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
FGCS
2006
68views more  FGCS 2006»
15 years 6 months ago
The first functional demonstration of optical virtual concatenation as a technique for achieving Terabit networking
The optical virtual concatenation (OVC) function of The Terabit LAN was demonstrated for the first time at the iGrid 2005 workshop in San Diego, California. The TERAbit-LAN establ...
Akira Hirano, Luc Renambot, Byungil Jeong, Jason L...