Sciweavers

1657 search results - page 261 / 332
» Network flow spanners
Sort
View
ICMLA
2008
15 years 4 months ago
Probabilistic Exploitation of the Lucas and Kanade Smoothness Constraint
The basic idea of Lucas and Kanade is to constrain the local motion measurement by assuming a constant velocity within a spatial neighborhood. We reformulate this spatial constrai...
Volker Willert, Julian Eggert, Marc Toussaint, Edg...
110
Voted
SOCRATES
2008
105views Education» more  SOCRATES 2008»
15 years 4 months ago
Laboratory Door Opens to Non-formal Learning Communities. Science Centres as Mediators
The e-KNOWNET is a Lifelong Learning project, which aims to develop an innovative and viable mechanism to facilitate the flow of new scientific knowledge produced in the research ...
G. Anyfandi, V. Laopodis, V. Koulaidis, Nicolas Ap...
115
Voted
SODA
2001
ACM
93views Algorithms» more  SODA 2001»
15 years 4 months ago
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
David Eppstein
BNT
1997
15 years 4 months ago
Tag-switching architecture: overview
Tag switching is a way to combine the label-swapping forwarding paradigm with network layer routing. This has several advantages. Tags can have a wide spectrum of forwarding granu...
Yakov Rekhter
141
Voted
OSDI
2000
ACM
15 years 4 months ago
End-to-End Authorization
Many boundaries impede the flow of authorization information, forcing applications that span those boundaries into hop-by-hop approaches to authorization. We present a unified app...
Jon Howell, David Kotz