Sciweavers

8398 search results - page 1380 / 1680
» Optimal Software Testing
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
WWW
2009
ACM
16 years 7 months ago
Combining anchor text categorization and graph analysis for paid link detection
In order to artificially boost the rank of commercial pages in search engine results, search engine optimizers pay for links to these pages on other websites. Identifying paid lin...
Kirill Nikolaev, Ekaterina Zudina, Andrey Gorshkov
298
Voted
CP
2009
Springer
16 years 7 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
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 ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
RECOMB
2009
Springer
16 years 7 months ago
Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
Saket Navlakha, James Robert White, Niranjan Nagar...
CHI
2007
ACM
16 years 7 months ago
An interface to support color blind computer users
A new method for adapting digital images so that they are suitable for color blind viewers is presented. In contrast to earlier automatic methods which formulate the problem of ad...
Luke Jefferson, Richard Harvey
« Prev « First page 1380 / 1680 Last » Next »