Sciweavers

6036 search results - page 1121 / 1208
» Web search solved
Sort
View
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
16 years 4 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 4 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
VLDB
2004
ACM
104views Database» more  VLDB 2004»
16 years 4 months ago
Retrieval effectiveness of an ontology-based model for information selection
Technology in the field of digital media generates huge amounts of nontextual information, audio, video, and images, along with more familiar textual information. The potential for...
Latifur Khan, Dennis McLeod, Eduard H. Hovy
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
Electors Voting for Fast Automatic Shape Correspondence
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
Oscar Kin-Chung Au, Chiew-Lan Tai, Daniel Cohen-Or...
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
16 years 1 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
« Prev « First page 1121 / 1208 Last » Next »