455 search results - page 74 / 91 » A local approximation algorithm for maximum weight matching |
123
click to vote
DIALM
2008
ACM
15 years 3 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
115
click to vote
IJCV
2000
15 years 1 months ago
2000
This paper introduces a uniform statistical framework for both 3-D and 2-D object recognition using intensity images as input data. The theoretical part provides a mathematical too...
179
click to vote
MFCS
2010
Springer
14 years 11 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
156
click to vote
INFOCOM
1998
IEEE
15 years 5 months ago
1998
IEEE
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
115
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...