Sciweavers

2629 search results - page 304 / 526
» complex 2009
Sort
View
ICALP
2009
Springer
16 years 5 months ago
When Are Timed Automata Determinizable?
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
Christel Baier, Nathalie Bertrand, Patricia Bouyer...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 5 months ago
Keyword search on structured and semi-structured data
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
Yi Chen, Wei Wang 0011, Ziyang Liu, Xuemin Lin

Publication
1301views
16 years 5 months ago
Markovian Tracking-by-Detection from a Single, Uncalibrated Camera
We present an algorithm for multi-person tracking-bydetection in a particle filtering framework. To address the unreliability of current state-of-the-art object detectors, our a...
Michael D. Breitenstein, Fabian Reichlin, Bastian ...
ICIP
2009
IEEE
16 years 3 months ago
On the Use of Color Appearance Modeling for Efficient Compressed-Domain Image Enhancement
In this paper we propose a compressed-domain image enhancement algorithm based on color appearance modeling. We aim at providing an efficient high-quality JPEG color image enhancem...
Maria Chatzigiorgaki, Athanassios N. Skodras
165
Voted
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 2 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...