Sciweavers

2434 search results - page 58 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
APPROX
2008
Springer
125views Algorithms» more  APPROX 2008»
15 years 5 months ago
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
155
Voted
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 10 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
129
Voted
EDBT
2006
ACM
113views Database» more  EDBT 2006»
15 years 5 months ago
Deferred Maintenance of Disk-Based Random Samples
Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on seco...
Rainer Gemulla, Wolfgang Lehner
CIAC
2006
Springer
84views Algorithms» more  CIAC 2006»
15 years 7 months ago
In-Place Randomized Slope Selection
Slope selection is a well-known algorithmic tool used in the context of computing robust estimators for fitting a line to a collection P of n points in the plane. We demonstrate th...
Henrik Blunck, Jan Vahrenhold
BMCBI
2008
179views more  BMCBI 2008»
15 years 3 months ago
Building pathway clusters from Random Forests classification using class votes
Background: Recent years have seen the development of various pathway-based methods for the analysis of microarray gene expression data. These approaches have the potential to bri...
Herbert Pang, Hongyu Zhao