Sciweavers

2434 search results - page 273 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
AI
2003
Springer
15 years 9 months ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
118
Voted
STOC
1998
ACM
125views Algorithms» more  STOC 1998»
15 years 8 months ago
Spot-Checkers
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
Funda Ergün, Sampath Kannan, Ravi Kumar, Roni...
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
15 years 5 months ago
Adaptive Informative Sampling for Active Learning
Many approaches to active learning involve periodically training one classifier and choosing data points with the lowest confidence. An alternative approach is to periodically cho...
Zhenyu Lu, Xindong Wu, Josh Bongard
EMMCVPR
1999
Springer
15 years 8 months ago
Adaptive Bayesian Contour Estimation: A Vector Space Representation Approach
Abstract. We propose a vector representation approach to contour estimation from noisy data. Images are modeled as random elds composed of a set of homogeneous regions contours (bo...
José M. B. Dias
ICASSP
2010
IEEE
15 years 4 months ago
Toward signal processing theory for graphs and non-Euclidean data
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
Benjamin A. Miller, Nadya T. Bliss, Patrick J. Wol...