Sciweavers

1740 search results - page 199 / 348
» Minimal structures for stories
Sort
View
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 8 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
CVPR
2007
IEEE
15 years 8 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
ECCV
2010
Springer
15 years 8 months ago
Exploiting Repetitive Object Patterns for Model Compression and Completion
Many man-made and natural structures consist of similar elements arranged in regular patterns. In this paper we present an unsupervised approach for discovering and reasoning on re...
SIGIR
2010
ACM
15 years 8 months ago
Prototype hierarchy based clustering for the categorization and navigation of web collections
This paper presents a novel prototype hierarchy based clustering (PHC) framework for the organization of web collections. It solves simultaneously the problem of categorizing web ...
Zhaoyan Ming, Kai Wang, Tat-Seng Chua
ASAP
2004
IEEE
119views Hardware» more  ASAP 2004»
15 years 7 months ago
Automatic Synthesis of Customized Local Memories for Multicluster Application Accelerators
Distributed local memories, or scratchpads, have been shown to effectively reduce cost and power consumption of application-specific accelerators while maintaining performance. Th...
Manjunath Kudlur, Kevin Fan, Michael L. Chu, Scott...