Sciweavers

Share
4 search results - page 1 / 1
» Compression Optimized Tracing of Digital Curves using Graph ...
Sort
View
ICIP
2007
IEEE
11 years 12 months ago
Compression Optimized Tracing of Digital Curves using Graph Theory
The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-art method considers a quadtree decompositio...
András Hajdu, Ioannis Pitas
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
11 years 5 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
12 years 5 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
12 years 6 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
books