531 search results - page 85 / 107 » A Better Algorithm for Random k-SAT |
FGR
2011
IEEE
12 years 11 months ago
2011
IEEE
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
ISCC
2002
IEEE
14 years 22 days ago
2002
IEEE
In this paper, we propose a refinement of TCP Westwood allowing the management of the Efficiency/Friendliness-toNewReno tradeoff. We show that the refined TCP Westwood is able to ...
SPAA
1997
ACM
14 years 8 hour ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...