Sciweavers

1632 search results - page 105 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
147
Voted
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
15 years 8 months ago
A simulation-based method for aggregating Markov chains
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
136
Voted
ICPR
2002
IEEE
15 years 8 months ago
A Robust Algorithm for Probabilistic Human Recognition From
Human recognition from video requires solving the two tasks, recognition and tracking, simultaneously. This leads to a parameterized time series state space model, representing bo...
Shaohua Kevin Zhou, Rama Chellappa
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
15 years 3 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
131
Voted
ICA
2010
Springer
15 years 4 months ago
Blind Source Separation Based on Time-Frequency Sparseness in the Presence of Spatial Aliasing
In this paper, we propose a novel method for blind source separation (BSS) based on time-frequency sparseness (TF) that can estimate the number of sources and time-frequency masks,...
Benedikt Loesch, Bin Yang
127
Voted
WG
2005
Springer
15 years 9 months ago
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
Christophe Crespelle, Christophe Paul