7978 search results - page 776 / 1596 » Combining shared-coin algorithms |
321
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
217
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
217
click to vote
ICCAD
2003
IEEE
16 years 4 months ago
2003
IEEE
DNA probe arrays have emerged as a core genomic technology that enables cost-effective gene expression monitoring, mutation detection, single nucleotide polymorphism analysis and ...
202
click to vote
LCTRTS
2009
Springer
16 years 2 months ago
2009
Springer
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
198
click to vote
INFOCOM
2009
IEEE
16 years 2 months ago
2009
IEEE
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...