2260 search results - page 87 / 452 » A new algorithm for clustering search results |
159
click to vote
ISCAS
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and p...
172
click to vote
ATAL
2009
Springer
16 years 23 days ago
2009
Springer
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
170
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is...
182
click to vote
CIKM
2009
Springer
16 years 23 days ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
132
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
In a higher level task such as clustering of web results or word sense disambiguation, knowledge of all possible distinct concepts in which an ambiguous word can be expressed woul...