Sciweavers

2372 search results - page 312 / 475
» Probabilistic calling context
Sort
View
GIS
2003
ACM
14 years 9 months ago
A predictive location model for location-based services
Location-Based Services (LBSs) utilize information about users' locations through location-aware mobile devices to provide services, such as nearest features of interest, the...
Hassan A. Karimi, Xiong Liu
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 8 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
KDD
2007
ACM
176views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining correlated bursty topic patterns from coordinated text streams
Previous work on text mining has almost exclusively focused on a single stream. However, we often have available multiple text streams indexed by the same set of time points (call...
Xuanhui Wang, ChengXiang Zhai, Xiao Hu, Richard Sp...
RECOMB
2004
Springer
14 years 8 months ago
Computational identification of evolutionarily conserved exons
Phylogenetic hidden Markov models (phylo-HMMs) have recently been proposed as a means for addressing a multispecies version of the ab initio gene prediction problem. These models ...
Adam C. Siepel, David Haussler
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 8 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking