Sciweavers

35 search results - page 5 / 7
» Fast Update Algorithm for IP Forwarding Table Using Independ...
Sort
View
INFOCOM
2002
IEEE
14 years 13 days ago
Scalable IP Lookup for Programmable Routers
Abstract— Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services...
David E. Taylor, John W. Lockwood, Todd S. Sproull...
INFOCOM
2010
IEEE
13 years 6 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
PERCOM
2011
ACM
12 years 11 months ago
P3-coupon: A probabilistic system for Prompt and Privacy-preserving electronic coupon distribution
—In this paper, we propose P3 -coupon, a Prompt and Privacy-preserving electronic coupon distribution system based on a Probabilistic one-ownership forwarding algorithm. In this ...
Boying Zhang, Jin Teng, Xiaole Bai, Zhimin Yang, D...
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 8 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 8 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand