7930 search results - page 336 / 1586 » Greedy in Approximation Algorithms |
196
click to vote
TON
2010
15 years 5 months ago
2010
—We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multi-path connectivity (k-connectivity) between all nodes. Such a guarante...
151
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
We present an improved, prescient, scheme to deliver pre-encoded video streams at very low latency. We dynamically manage the prediction dependency for a group of packets using a ...
311
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
183
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
219
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...