Sciweavers

806 search results - page 111 / 162
» Lower Bounds on Correction Networks
Sort
View
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
15 years 1 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
14 years 12 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
DM
2010
77views more  DM 2010»
14 years 12 months ago
Representing (0, 1)-matrices by boolean circuits
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
Stasys Jukna
CAD
2004
Springer
14 years 11 months ago
ESOLID - a system for exact boundary evaluation
We present a system, ESOLID, that performs exact boundary evaluation of low-degree curved solids in reasonable amounts of time. ESOLID performs accurate Boolean operations using e...
John Keyser, Tim Culver, Mark Foskey, Shankar Kris...
ANCS
2007
ACM
15 years 3 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley