Sciweavers

3898 search results - page 423 / 780
» On the Bit Extraction Problem
Sort
View
INFOCOM
2010
IEEE
15 years 3 months ago
Leaping Multiple Headers in a Single Bound: Wire-Speed Parsing Using the Kangaroo System
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...
Christos Kozanitis, John Huber, Sushil Singh, Geor...
SIGIR
2011
ACM
14 years 7 months ago
Mining tags using social endorsement networks
Entities on social systems, such as users on Twitter, and images on Flickr, are at the core of many interesting applications: they can be ranked in search results, recommended to ...
Theodoros Lappas, Kunal Punera, Tamás Sarlo...
ICIP
2008
IEEE
16 years 6 months ago
Coding-gain-based complexity control for H.264 video encoder
The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and s...
Ming-Chen Chien, Zong-Yi Chen, Pao-Chi Chang
PODC
2009
ACM
16 years 5 months ago
Tight bounds for clock synchronization
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 5 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur