1629 search results - page 269 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
EOR
2010
14 years 10 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...
109
click to vote
CVPR
2003
IEEE
15 years 12 months ago
2003
IEEE
We are building a system that can automatically acquire 3D range scans and 2D images to build geometrically and photometrically correct 3D models of urban environments. A major bo...
201
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract-- Scientific workflow management systems are increaingly providing the ability to manage and query the provenance of data products. However, the problem of differencing th...
106
click to vote
SAC
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we describe a new approach for mining concept associations from large text collections. The concepts are short sequences of words that occur frequently together acr...