Sciweavers

2994 search results - page 164 / 599
» Time sequences
Sort
View
PAMI
2010
112views more  PAMI 2010»
15 years 1 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
137
Voted
QEST
2010
IEEE
15 years 1 months ago
Fortuna: Model Checking Priced Probabilistic Timed Automata
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
Jasper Berendsen, David N. Jansen, Frits W. Vaandr...
134
Voted
SAC
2009
ACM
15 years 10 months ago
A new protein motif extraction framework based on constrained co-clustering
Signal finding (pattern discovery) in biological sequences is a fundamental problem in both computer science and molecular biology. Many approaches have been proposed for extract...
Francesca Cordero, Alessia Visconti, Marco Botta
CVPR
2009
IEEE
1081views Computer Vision» more  CVPR 2009»
16 years 10 months ago
Learning Real-Time MRF Inference for Image Denoising
Many computer vision problems can be formulated in a Bayesian framework with Markov Random Field (MRF) or Conditional Random Field (CRF) priors. Usually, the model assumes that ...
Adrian Barbu (Florida State University)
ICCAD
2004
IEEE
180views Hardware» more  ICCAD 2004»
16 years 6 days ago
Physical placement driven by sequential timing analysis
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...
Aaron P. Hurst, Philip Chong, Andreas Kuehlmann