Sciweavers

1171 search results - page 62 / 235
» Multisource Algorithmic Information Theory
Sort
View
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
15 years 2 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
CORR
2012
Springer
183views Education» more  CORR 2012»
13 years 5 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar
COGSCI
2011
49views more  COGSCI 2011»
14 years 4 months ago
What a Rational Parser Would Do
This article examines cognitive process models of human sentence comprehension based on the idea of informed search. These models are rational in the sense that they strive to qui...
John T. Hale
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 3 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
WADS
2005
Springer
133views Algorithms» more  WADS 2005»
15 years 3 months ago
Heap Building Bounds
We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case[2...
Zhentao Li, Bruce A. Reed