Sciweavers

15485 search results - page 93 / 3097
» Computing Optimal Subsets
Sort
View
FOCS
1993
IEEE
14 years 3 months ago
Simulated Annealing for Graph Bisection
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
Mark Jerrum, Gregory B. Sorkin
CVPR
2007
IEEE
14 years 3 months ago
Inferring 3D Volumetric Shape of Both Moving Objects and Static Background Observed by a Moving Camera
We present a novel approach to inferring 3D volumetric shape of both moving objects and static background from video sequences shot by a moving camera, with the assumption that th...
Chang Yuan, Gérard G. Medioni
ISCI
2008
116views more  ISCI 2008»
13 years 11 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
TMI
2008
140views more  TMI 2008»
13 years 11 months ago
Hamilton-Jacobi Skeleton on Cortical Surfaces
Abstract-- In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In o...
Yonggang Shi, Paul M. Thompson, Ivo D. Dinov, Arth...
ACL
2012
12 years 1 months ago
Discriminative Pronunciation Modeling: A Large-Margin, Feature-Rich Approach
We address the problem of learning the mapping between words and their possible pronunciations in terms of sub-word units. Most previous approaches have involved generative modeli...
Hao Tang, Joseph Keshet, Karen Livescu