2137 search results - page 310 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
212
Voted
PODS
2009
ACM
16 years 5 months ago
2009
ACM
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
— We explore the interconnection between search and action in the context of mobile robotics. The task of searching for an object and then performing some action with that object...
144
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
137
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
143
click to vote
CODES
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in DFG represents a coarse grain block such as FIR and...