Sciweavers

1313 search results - page 73 / 263
» Data Discretization Unification
Sort
View
SODA
2010
ACM
409views Algorithms» more  SODA 2010»
14 years 6 months ago
Data Structures for Range Minimum Queries in Multidimensional Arrays
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
Hao Yuan, Mikhail J. Atallah
PADS
2006
ACM
14 years 3 months ago
Aurora: An Approach to High Throughput Parallel Simulation
A master/worker paradigm for executing large-scale parallel discrete event simulation programs over networkenabled computational resources is proposed and evaluated. In contrast t...
Alfred Park, Richard M. Fujimoto
CVPR
2004
IEEE
14 years 22 days ago
Efficient Graphical Models for Processing Images
Graphical models are powerful tools for processing images. However, the large dimensionality of even local image data poses a difficulty: representing the range of possible graphi...
Marshall F. Tappen, Bryan C. Russell, William T. F...
ECML
2006
Springer
14 years 20 days ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
ISICA
2007
Springer
14 years 3 months ago
Parameter Setting for Evolutionary Latent Class Clustering
The latent class model or multivariate multinomial mixture is a powerful model for clustering discrete data. This model is expected to be useful to represent non-homogeneous popula...
Damien Tessier, Marc Schoenauer, Christophe Bierna...