Sciweavers

995 search results - page 154 / 199
» complexity 2011
Sort
View
167
Voted
SIGMOD
2011
ACM
230views Database» more  SIGMOD 2011»
14 years 5 months ago
GBLENDER: visual subgraph query formulation meets query processing
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, By...
143
Voted
SIGMOD
2011
ACM
222views Database» more  SIGMOD 2011»
14 years 5 months ago
Data generation using declarative constraints
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
Arvind Arasu, Raghav Kaushik, Jian Li
149
Voted
ICCV
2011
IEEE
14 years 2 months ago
Strong Supervision From Weak Annotation: Interactive Training of Deformable Part Models
We propose a framework for large scale learning and annotation of structured models. The system interleaves interactive labeling (where the current model is used to semiautomate t...
Steven Branson, Pietro Perona, Serge Belongie
ICCV
2011
IEEE
14 years 2 months ago
Kernel Non-Rigid Structure from Motion
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...
Paulo F. U. Gotardo, Aleix M. Martinez
143
Voted
ICCV
2011
IEEE
14 years 2 months ago
A 3D Laplacian-Driven Parametric Deformable Model
3D parametric deformable models have been used to extract volumetric object boundaries and they generate smooth boundary surfaces as results. However, in some segmentation cases, ...
Tian Shen, Xiaolei Huang, Hongsheng Li, Edward Kim...