14548 search results - page 2589 / 2910 » The Optimal Path-Matching Problem |
292
Voted
CP
2009
Springer
16 years 7 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
159
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
183
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
196
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
172
click to vote
CHI
2008
ACM
16 years 7 months ago
2008
ACM
In this paper, we describe an innovative tool that supports the design and evaluation of the information architecture of a Web site. The tool uses Latent Semantic Analysis and hie...