Sciweavers

1871 search results - page 122 / 375
» The Ephemeral Pairing Problem
Sort
View
CONEXT
2008
ACM
15 years 1 months ago
Overlay routing using coordinate systems
We address the problem of finding indirect overlay paths that reduce the latency between pairs of nodes in an overlay. To this end we propose to rely on an Internet Coordinate Sys...
François Cantin, Bamba Gueye, Dali Kaafar, ...
DAGM
2008
Springer
15 years 1 months ago
Efficient Tracking as Linear Program on Weak Binary Classifiers
This paper demonstrates how a simple, yet effective, set of features enables to integrate ensemble classifiers in optical flow based tracking. In particular, gray value differences...
Michael Grabner, Christopher Zach, Horst Bischof
FLAIRS
2001
15 years 25 days ago
A Decision Support System for Local Government Regulatory Advice
This paper describes the implementationof a decision support systemthat helps non-technicalfront-line reception staff handle complex enquiries on a wide range of local government ...
Ian Watson
NAACL
2003
15 years 24 days ago
Learning to Paraphrase: An Unsupervised Approach Using Multiple-Sequence Alignment
We address the text-to-text generation problem of sentence-level paraphrasing — a phenomenon distinct from and more difficult than word- or phrase-level paraphrasing. Our appro...
Regina Barzilay, Lillian Lee
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
14 years 11 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...