Sciweavers

4781 search results - page 705 / 957
» Complexity at large
Sort
View
108
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 25 days ago
Semantics and Evaluation of Top-k Queries in Probabilistic Databases
Abstract. We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are asso...
Xi Zhang, Jan Chomicki
107
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 25 days ago
A Spectral Algorithm for Learning Hidden Markov Models
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
Daniel Hsu, Sham M. Kakade, Tong Zhang
CORR
2008
Springer
84views Education» more  CORR 2008»
15 years 25 days ago
The Latent Relation Mapping Engine: Algorithm and Experiments
Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure ...
Peter D. Turney
DEBU
2008
118views more  DEBU 2008»
15 years 25 days ago
Big, Fast XQuery: Enabling Content Applications
Increasingly, companies recognize that most of their important information does not exist in relational stores but in documents. For a long time, textual information has been rela...
Mary Holstege
85
Voted
ENTCS
2010
88views more  ENTCS 2010»
15 years 25 days ago
On the Observable Behaviour of Composite Components
The crucial strength of the component paradigm lies in the possibility to encapsulate behaviours. In this work, we focus on the observable behaviour of composite components which ...
Rolf Hennicker, Stephan Janisch, Alexander Knapp