Sciweavers

2735 search results - page 360 / 547
» Generalized Displacement Maps
Sort
View
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
16 years 7 months ago
Catching the drift: learning broad matches from clickthrough data
Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Eff...
Sonal Gupta, Mikhail Bilenko, Matthew Richardson
KDD
2008
ACM
244views Data Mining» more  KDD 2008»
16 years 7 months ago
Probabilistic latent semantic visualization: topic model for visualizing documents
We propose a visualization method based on a topic model for discrete data such as documents. Unlike conventional visualization methods based on pairwise distances such as multi-d...
Tomoharu Iwata, Takeshi Yamada, Naonori Ueda
CHI
2005
ACM
16 years 7 months ago
Improving orchestral conducting systems in public spaces: examining the temporal characteristics and conceptual models of conduc
Designing interactive conducting exhibits for public spaces poses unique challenges, primarily because the conceptual model of conducting music varies amongst users. In a user stu...
Eric Lee, Marius Wolf, Jan Borchers
RECOMB
2002
Springer
16 years 6 months ago
Provably sensitive Indexing strategies for biosequence similarity search
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
Jeremy Buhler
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
16 years 6 months ago
Distributed data-parallel computing using a high-level programming language
The Dryad and DryadLINQ systems offer a new programming model for large scale data-parallel computing. They generalize previous execution environments such as SQL and MapReduce in...
Michael Isard, Yuan Yu