Sciweavers

2412 search results - page 181 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
130
Voted
SCP
1998
107views more  SCP 1998»
15 years 3 months ago
A Distributed Arc-Consistency Algorithm
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
T. Nguyen, Yves Deville
IJCV
2010
168views more  IJCV 2010»
15 years 2 months ago
Baselines for Image Annotation
Automatically assigning keywords to images is of great interest as it allows one to retrieve, index, organize and understand large collections of image data. Many techniques have b...
Ameesh Makadia, Vladimir Pavlovic, Sanjiv Kumar
121
Voted
AAAI
2004
15 years 5 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...
JACM
2006
99views more  JACM 2006»
15 years 3 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
141
Voted
CIKM
2008
Springer
15 years 5 months ago
SoRec: social recommendation using probabilistic matrix factorization
Data sparsity, scalability and prediction quality have been recognized as the three most crucial challenges that every collaborative filtering algorithm or recommender system conf...
Hao Ma, Haixuan Yang, Michael R. Lyu, Irwin King