1184 search results - page 121 / 237 » Algorithmic Results in List Decoding |
116
Voted
DAWAK
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present a technique for discovering and representing changes between versions of data warehouse structures. We select a tree comparison algorithm, adapt it for the par...
136
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
103
Voted
GCB
1997
Springer
15 years 7 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
119
click to vote
AAAI
2007
15 years 5 months ago
2007
Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagatio...
124
click to vote
CCCG
2001
15 years 4 months ago
2001
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...