Sciweavers

9209 search results - page 14 / 1842
» Data Space Randomization
Sort
View
AAAI
2008
13 years 10 months ago
Manifold Integration with Markov Random Walks
Most manifold learning methods consider only one similarity matrix to induce a low-dimensional manifold embedded in data space. In practice, however, we often use multiple sensors...
Heeyoul Choi, Seungjin Choi, Yoonsuck Choe
STOC
1996
ACM
101views Algorithms» more  STOC 1996»
13 years 11 months ago
The Space Complexity of Approximating the Frequency Moments
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
Noga Alon, Yossi Matias, Mario Szegedy
DKE
2008
72views more  DKE 2008»
13 years 7 months ago
On space constrained set selection problems
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
Themis Palpanas, Nick Koudas, Alberto O. Mendelzon
RECOMB
2008
Springer
14 years 8 months ago
Algorithms for Exploring the Space of Gene Tree/Species Tree Reconciliations
We describe algorithms to explore the space of all possible reconciliations between a gene tree and a species tree. We propose an algorithm for generating a random reconciliation, ...
Jean-Philippe Doyon, Cedric Chauve, Sylvie Hamel
EMMCVPR
1999
Springer
13 years 12 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