1390 search results - page 150 / 278 » Computing the depth of a flat |
ALGORITHMICA
2005
14 years 10 months ago
2005
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
VC
2008
14 years 10 months ago
2008
Modeling is a severe bottleneck for computer graphics applications. Manual modeling is time consuming and fails to capture the complexity of real world scenes. Automated modeling b...
SIAMCOMP
2000
14 years 9 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
2729
click to vote
CVPR
2011
IEEE
14 years 6 months ago
2011
IEEE
Kernel descriptors provide a unified way to generate rich visual feature sets by turning pixel attributes into patch-level features, and yield impressive results on many object rec...
115
click to vote
SIGGRAPH
2010
ACM
15 years 2 months ago
2010
ACM
Repeated elements are ubiquitous and abundant in both manmade and natural scenes. Editing such images while preserving the repetitions and their relations is nontrivial due to over...