Sciweavers

99 search results - page 12 / 20
» Path diversity is only part of the problem
Sort
View
ICCV
2005
IEEE
14 years 1 months ago
Space-Time Scene Manifolds
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
Yonatan Wexler, Denis Simakov
IMC
2010
ACM
13 years 5 months ago
What happened in my network: mining network events from router syslogs
Router syslogs are messages that a router logs to describe a wide range of events observed by it. They are considered one of the most valuable data sources for monitoring network ...
Tongqing Qiu, Zihui Ge, Dan Pei, Jia Wang, Jun Xu
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
13 years 7 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...
COMPGEOM
2010
ACM
14 years 17 days ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
AAIM
2009
Springer
123views Algorithms» more  AAIM 2009»
14 years 2 months ago
Efficiently Generating k-Best Solutions to Procurement Auctions
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...
Andrew Byde, Terence Kelly, Yunhong Zhou, Robert E...