Sciweavers

1559 search results - page 310 / 312
» Fundamentals of Generic Programming
Sort
View
MST
2007
167views more  MST 2007»
14 years 9 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
INFOCOM
2010
IEEE
14 years 8 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...
INTERNET
2010
170views more  INTERNET 2010»
14 years 8 months ago
Developing RESTful Web Services with Webmachine
bstractions and mechanisms Webmachine supplies to RESTful Web services developers. Not Your Typical Framework Web services frameworks typically fall into one of the following broad...
Justin Sheehy, Steve Vinoski
WIOPT
2010
IEEE
14 years 8 months ago
On maximizing collaboration in Wireless Mesh Networks without monetary incentives
—In distributed network settings, where nodes are not under the control of a single administrative entity, the fulfillment of fundamental network operations is heavily dependent...
Gabriel Popa, Éric Gourdin, Franck Legendre...
WWW
2011
ACM
14 years 4 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii