Sciweavers

1071 search results - page 54 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
3DPVT
2004
IEEE
136views Visualization» more  3DPVT 2004»
13 years 12 months ago
Efficient Model Creation of Large Structures based on Range Segmentation
This paper describes an efficient 3D modeling method from 3D range data-sets that is utilizing range data segmentation. Our algorithm starts with a set of unregistered 3D range sc...
Ioannis Stamos, Marius Leordeanu
JASIS
2008
102views more  JASIS 2008»
13 years 8 months ago
Hierarchical summarization of large documents
mation science has shown that human abstractors extract sentences for summaries based on the hierarchical structure of documents; however, the existing automatic summarization mode...
Christopher C. Yang, Fu Lee Wang
LFCS
2007
Springer
14 years 2 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
ICIP
2003
IEEE
14 years 9 months ago
Feature selection for unsupervised discovery of statistical temporal structures in video
We present algorithms for automatic feature selection for unsupervised structure discovery from video sequences. Feature selection in this scenario is hard because of the absence ...
Lexing Xie, Shih-Fu Chang, Ajay Divakaran, Huifang...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan