Sciweavers

526 search results - page 62 / 106
» On the Number of Minimal Addition Chains
Sort
View
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 6 days ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
WWW
2008
ACM
15 years 10 months ago
Analyzing search engine advertising: firm behavior and cross-selling in electronic markets
The phenomenon of sponsored search advertising is gaining ground as the largest source of revenues for search engines. Firms across different industries have are beginning to adop...
Anindya Ghose, Sha Yang
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
15 years 10 months ago
Cut-and-stitch: efficient parallel learning of linear dynamical systems on smps
Multi-core processors with ever increasing number of cores per chip are becoming prevalent in modern parallel computing. Our goal is to make use of the multi-core as well as multi...
Lei Li, Wenjie Fu, Fan Guo, Todd C. Mowry, Christo...
QEST
2008
IEEE
15 years 4 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
GCB
2003
Springer
105views Biometrics» more  GCB 2003»
15 years 3 months ago
In silico prediction of UTR repeats using clustered EST data
Clustering of EST data is a method for the non-redundant representation of an organisms transcriptome. During clustering of large amounts of EST data, usually some large clusters ...
Stefan A. Rensing, Daniel Lang, Ralf Reski