Sciweavers

3415 search results - page 508 / 683
» Lower bounds on kernelization
Sort
View
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
15 years 4 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
CORR
2011
Springer
210views Education» more  CORR 2011»
15 years 1 months ago
Statistical Compressed Sensing of Gaussian Mixture Models
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
Guoshen Yu, Guillermo Sapiro
254
Voted
ICIP
2005
IEEE
16 years 7 months ago
A dynamic Bezier curve model
Bezier curves (BC) are fundamental to a wide range of applications from computer-aided design through to object shape descriptions and surface mapping. Since BC only consider glob...
Ferdous Ahmed Sohel, Laurence S. Dooley, Gour C. K...
VIS
2004
IEEE
222views Visualization» more  VIS 2004»
16 years 7 months ago
Non-Linear Model Fitting to Parameterize Diseased Blood Vessels
Accurate estimation of vessel parameters is a prerequisite for automated visualization and analysis of healthy and diseased blood vessels. The objective of this research is to est...
Alexandra La Cruz, Matús Straka, Arnold K&o...
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 6 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis