Sciweavers

1921 search results - page 207 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
KDD
2012
ACM
181views Data Mining» more  KDD 2012»
13 years 8 months ago
On "one of the few" objects
Objects with multiple numeric attributes can be compared within any “subspace” (subset of attributes). In applications such as computational journalism, users are interested i...
You Wu, Pankaj K. Agarwal, Chengkai Li, Jun Yang 0...
EDCC
2010
Springer
15 years 11 months ago
Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
François Bonnet, Michel Raynal
PE
2008
Springer
167views Optimization» more  PE 2008»
15 years 6 months ago
Analysis of ratings on trust inference in open environments
Ratings (also known as recommendations) provide an efficient and effective way to build trust relationship in the human society, by making use of the information from others rathe...
Zhengqiang Liang, Weisong Shi
SIGIR
2005
ACM
15 years 12 months ago
Orthogonal locality preserving indexing
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 6 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...