Sciweavers

155 search results - page 12 / 31
» Dynamic Succinct Ordered Trees
Sort
View
CORR
2004
Springer
100views Education» more  CORR 2004»
14 years 9 months ago
On Spatial Conjunction as Second-Order Logic
Abstract. Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While re...
Viktor Kuncak, Martin C. Rinard
DEXA
2008
Springer
143views Database» more  DEXA 2008»
14 years 11 months ago
XML Filtering Using Dynamic Hierarchical Clustering of User Profiles
Information filtering systems constitute a critical component in modern information seeking applications. As the number of users grows and the information available becomes even bi...
Panagiotis Antonellis, Christos Makris
ICCV
2009
IEEE
14 years 7 months ago
Efficient human pose estimation via parsing a tree structure based human model
Human pose estimation is the task of determining the states (location, orientation and scale) of each body part. It is important for many vision understanding applications, e.g. v...
Xiaoqin Zhang, Changcheng Li, Xiaofeng Tong, Weimi...
TPDS
2010
144views more  TPDS 2010»
14 years 8 months ago
Performance Evaluation of Dynamic Speculative Multithreading with the Cascadia Architecture
—Thread-level parallelism (TLP) has been extensively studied in order to overcome the limitations of exploiting instruction-level parallelism (ILP) on high-performance superscala...
David A. Zier, Ben Lee
AINA
2009
IEEE
15 years 4 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin