6393 search results - page 1003 / 1279 » Randomized Algorithms on the Mesh |
146
click to vote
ALENEX
2010
15 years 6 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
122
Voted
DGO
2008
15 years 6 months ago
2008
We address the e-rulemaking problem of reducing the manual labor required to analyze public comment sets. In current and previous work, for example, text categorization techniques...
142
click to vote
NIPS
2007
15 years 6 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
137
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
146
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: One of the challenges of bioinformatics remains the recognition of short signal sequences in genomic DNA such as donor or acceptor splice sites, splicing enhancers or ...