Sciweavers

1717 search results - page 220 / 344
» A Computable Spectral Theorem
Sort
View
IPL
2011
109views more  IPL 2011»
15 years 27 days ago
Nondominated local coteries for resource allocation in grids and clouds
The resource allocation problem is a fundamental problem in Grid and Cloud computing environments. This paper focuses on constructing nondominated (ND) local coteries to solve the...
Jehn-Ruey Jiang
JCT
2011
83views more  JCT 2011»
15 years 27 days ago
Sandpile groups and spanning trees of directed line graphs
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
Lionel Levine
MFCS
2009
Springer
15 years 10 months ago
Time-Bounded Kolmogorov Complexity and Solovay Functions
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
Rupert Hölzl, Thorsten Kräling, Wolfgang...
CVPR
2009
IEEE
17 years 1 months ago
Shape Discovery from Unlabeled Image Collections
Can we discover common object shapes within unlabeled multi-category collections of images? While often a critical cue at the category-level, contour matches can be difficult to...
Yong Jae Lee (University of Texas at Austin), Kris...
ECCV
2006
Springer
16 years 7 months ago
Discovering Texture Regularity as a Higher-Order Correspondence Problem
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
James Hays, Marius Leordeanu, Alexei A. Efros, Yan...