Sciweavers

1208 search results - page 34 / 242
» Uniform eventown problems
Sort
View
GFKL
2007
Springer
139views Data Mining» more  GFKL 2007»
15 years 5 months ago
The Noise Component in Model-based Cluster Analysis
The so-called noise-component has been introduced by Banfield and Raftery (1993) to improve the robustness of cluster analysis based on the normal mixture model. The idea is to ad...
Christian Hennig, Pietro Coretto
ICALP
2007
Springer
15 years 5 months ago
Estimating Sum by Weighted Sampling
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarante...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
15 years 1 months ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
ICASSP
2010
IEEE
14 years 12 months ago
Adaptive search for sparse targets with informative priors
ACT This works considers the problem of efficient energy allocation of resources in a continuous fashion in determining the location of targets in a sparse environment. We extend ...
Gregory Newstadt, Eran Bashan, Alfred O. Hero III
83
Voted
AC
2003
Springer
15 years 5 months ago
Unbounded Petri Net Synthesis
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
Philippe Darondeau