Sciweavers

4298 search results - page 318 / 860
» Computing at the top of the world
Sort
View
ALGORITHMICA
2010
104views more  ALGORITHMICA 2010»
15 years 6 months ago
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
Liming Cai, Xiuzhen Huang
CVPR
2000
IEEE
16 years 8 months ago
Fast Multiscale Image Segmentation
We introduce a fast, multiscale algorithm for image segmentation. Our algorithm uses modern numeric techniques to nd an approximate solution to normalized cut measures in time tha...
Eitan Sharon, Achi Brandt, Ronen Basri
221
Voted
ICCV
2005
IEEE
16 years 8 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu
ICCV
2001
IEEE
16 years 8 months ago
Cloning Your Own Face with a Desktop Camera
: We have developed an easy and cost-effective system that constructs textured 3D animated face models from videos with minimal user interaction. Our system first takes, with an or...
Zhengyou Zhang, Zicheng Liu, Dennis Adler, Michael...
DAC
2009
ACM
16 years 7 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke