Sciweavers

1414 search results - page 230 / 283
» Cover Time and Broadcast Time
Sort
View
CJ
2008
97views more  CJ 2008»
13 years 10 months ago
Three Kinds of Probabilistic Induction: Universal Distributions and Convergence Theorems
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
Ray J. Solomonoff
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 10 months ago
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
Johan M. M. van Rooij, Hans L. Bodlaender
CROSSROADS
2008
109views more  CROSSROADS 2008»
13 years 10 months ago
Exploring global terrorism data: a web-based visualization of temporal data
Recently, there has been a dramatic increase in both the amount of terrorism related literature and public interest towards the matter. Even so, it is difficult to gain access to ...
Joonghoon Lee
CSDA
2008
108views more  CSDA 2008»
13 years 10 months ago
The random Tukey depth
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
J. A. Cuesta-Albertos, A. Nieto-Reyes
ALGORITHMICA
2006
77views more  ALGORITHMICA 2006»
13 years 10 months ago
Scalable Parallel Algorithms for FPT Problems
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...