Sciweavers

1176 search results - page 222 / 236
» Sparse reward processes
Sort
View
JAL
2006
114views more  JAL 2006»
13 years 10 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
DAM
2007
107views more  DAM 2007»
13 years 10 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
SIAMSC
2008
148views more  SIAMSC 2008»
13 years 10 months ago
Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
A multilevel adaptive aggregation method for calculating the stationary probability vector of an irreducible stochastic matrix is described. The method is a special case of the ada...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...
IJCINI
2007
125views more  IJCINI 2007»
13 years 10 months ago
A Unified Approach To Fractal Dimensions
The Cognitive Processes of Abstraction and Formal Inferences J. A. Anderson: A Brain-Like Computer for Cognitive Software Applications: the Resatz Brain Project L. Flax: Cognitive ...
Witold Kinsner
TOIS
2008
145views more  TOIS 2008»
13 years 10 months ago
Classification-aware hidden-web text database selection
Many valuable text databases on the web have non-crawlable contents that are "hidden" behind search interfaces. Metasearchers are helpful tools for searching over multip...
Panagiotis G. Ipeirotis, Luis Gravano