6095 search results - page 336 / 1219 » Learning in Local Search |
182
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
157
Voted
SAT
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
135
click to vote
CPM
2004
Springer
16 years 3 days ago
2004
Springer
Optimized spaced seeds improve sensitivity and specificity in local homology search. Several authors have shown that multiple seeds can have better sensitivity and specificity t...
176
click to vote
EVOW
2004
Springer
16 years 3 days ago
2004
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackl...
169
click to vote
WEA
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...