241 search results - page 41 / 49 » Graphs, Hypergraphs and Hashing |
107
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
114
click to vote
DAC
2006
ACM
16 years 2 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
133
click to vote
PODS
2004
ACM
16 years 2 months ago
2004
ACM
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...
114
click to vote
SC
1991
ACM
15 years 5 months ago
1991
ACM
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
93
Voted
ICFP
2008
ACM
16 years 1 months ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...