2542 search results - page 389 / 509 » Computing Cartograms with Optimal Complexity |
INFOCOM
2011
IEEE
13 years 2 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
STOC
2009
ACM
14 years 11 months ago
2009
ACM
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...
BIBE
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract—Recent improvements in high-throughput genotyping technology make possible genome-wide association studies and status prediction (classification) for common complex dis...
DATE
1998
IEEE
14 years 2 months ago
1998
IEEE
As the "system-on-a-chip" concept is rapidly becoming a reality, time-to-market and product complexity push the reuse of complex macromodules. Circuits combining a varie...
JCB
2006
13 years 10 months ago
2006
Abstract We present a new approach for aligning families of 2D gels. Instead of choosing one of the gels as reference and performing pairwise alignment, we construct an ideal gel t...