Sciweavers

6104 search results - page 353 / 1221
» Constructing Information Bases Using Associative Structures
Sort
View
AINA
2009
IEEE
15 years 12 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
ECCV
2010
Springer
15 years 10 months ago
Weakly Supervised Shape Based Object Detection with Particle Filter
Abstract. We describe an efficient approach to construct shape models composed of contour parts with partially-supervised learning. The proposed approach can easily transfer parts ...
IJAR
2011
88views more  IJAR 2011»
15 years 2 days ago
A framework for reasoning under uncertainty based on non-deterministic distance semantics
Abstract. In this paper, we introduce a general and modular framework for formalizing reasoning with incomplete and inconsistent information. Our framework is composed of non-deter...
Ofer Arieli, Anna Zamansky
FLAIRS
2000
15 years 6 months ago
Graph-Based Hierarchical Conceptual Clustering
Hierarchical conceptual clustering has been proven to be a useful data mining technique. Graph-based representation of structural information has been shown to be successful in kn...
Istvan Jonyer, Lawrence B. Holder, Diane J. Cook
TVCG
2008
96views more  TVCG 2008»
15 years 5 months ago
Distributed Cognition as a Theoretical Framework for Information Visualization
Even though information visualization (InfoVis) research has matured in recent years, it is generally acknowledged that the field still lacks supporting, encompassing theories. In ...
Zhicheng Liu, Nancy J. Nersessian, John T. Stasko