Sciweavers

44651 search results - page 8858 / 8931
» A Generalization of the Least General Generalization
Sort
View
ANCS
2011
ACM
13 years 10 months ago
A Scalability Study of Enterprise Network Architectures
The largest enterprise networks already contain hundreds of thousands of hosts. Enterprise networks are composed of Ethernet subnets interconnected by IP routers. These routers re...
Brent Stephens, Alan L. Cox, Scott Rixner, T. S. E...
ANCS
2011
ACM
13 years 10 months ago
ReClick - A Modular Dataplane Design Framework for FPGA-Based Network Virtualization
Network virtualization has emerged as a powerful technique to deploy novel services and experimental protocols over shared network infrastructures. Although recent research has hi...
Deepak Unnikrishnan, Justin Lu, Lixin Gao, Russell...
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
13 years 10 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
APPROX
2011
Springer
197views Algorithms» more  APPROX 2011»
13 years 10 months ago
Periodicity and Cyclic Shifts via Linear Sketches
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
Michael S. Crouch, Andrew McGregor
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
13 years 10 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
« Prev « First page 8858 / 8931 Last » Next »