Sciweavers

1225 search results - page 65 / 245
» The Instance Complexity Conjecture
Sort
View
ECCV
2010
Springer
14 years 2 months ago
Multiresolution models for object detection
Abstract. Most current approaches to recognition aim to be scaleinvariant. However, the cues available for recognizing a 300 pixel tall object are qualitatively different from tho...
TKDE
2008
121views more  TKDE 2008»
13 years 9 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
FPL
2003
Springer
76views Hardware» more  FPL 2003»
14 years 2 months ago
Quark Routing
With inherent problem complexity, ever increasing instance size and ever decreasing layout area, there is need in physical design for improved heuristics and algorithms. In this in...
Sean T. McCulloch, James P. Cohoon
CVPR
2011
IEEE
13 years 5 months ago
Learning the Easy Things First: Self-Paced Visual Category Discovery
Objects vary in their visual complexity, yet existing discovery methods perform “batch” clustering, paying equal attention to all instances simultaneously—regardless of the ...
Yong Jae Lee, Kristen Grauman
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 9 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite