Sciweavers

699 search results - page 103 / 140
» The method of combinatorial telescoping
Sort
View
EUROGRAPHICS
2010
Eurographics
14 years 5 months ago
Seamless Montage for Texturing Models
We present an automatic method to recover high-resolution texture over an object by mapping detailed photographs onto its surface. Such high-resolution detail often reveals inaccu...
Ran Gal, Yonatan Wexler, Eyal Ofek, Hugues Hoppe, ...
CVPR
2010
IEEE
14 years 5 months ago
Discriminative Clustering for Image Co-segmentation
Purely bottom-up, unsupervised segmentation of a single image into two segments remains a challenging task for computer vision. The co-segmentation problem is the process of joi...
Armand Joulin, Francis Bach, Jean Ponce
ISPD
2009
ACM
126views Hardware» more  ISPD 2009»
14 years 3 months ago
A new algorithm for simultaneous gate sizing and threshold voltage assignment
Gate sizing and threshold voltage (Vt) assignment are popular techniques for circuit timing and power optimization. Existing methods, by and large, are either sensitivity-driven h...
Yifang Liu, Jiang Hu
FOCS
2009
IEEE
14 years 3 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
ICDM
2009
IEEE
132views Data Mining» more  ICDM 2009»
14 years 3 months ago
Bayesian Overlapping Subspace Clustering
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Qiang Fu, Arindam Banerjee