3890 search results - page 528 / 778 » Computation of unirational fields |
158
click to vote
RECOMB
2002
Springer
16 years 7 months ago
2002
Springer
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
146
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
168
Voted
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
185
click to vote
PPOPP
2010
ACM
16 years 4 months ago
2010
ACM
We present a static analysis for the automatic generation of symbolic prefetches in a transactional distributed shared memory. A symbolic prefetch specifies the first object to be...
199
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Markov random fields (MRFs) are popular and generic probabilistic models of prior knowledge in low-level vision. Yet their generative properties are rarely examined, while applica...