Sciweavers

943 search results - page 172 / 189
» How should data structures and algorithms be taught
Sort
View
AINA
2010
IEEE
14 years 1 months ago
Grid of Segment Trees for Packet Classification
—Packet classification problem has received much attention and continued to be an important topic in recent years. In packet classification problem, each incoming packet should b...
Yeim-Kuan Chang, Yung-Chieh Lin, Chen-Yu Lin
ACL
1989
13 years 9 months ago
The Lexical Semantics of Comparative Expressions in a Multi-Level Semantic Processor
Comparative expressions (CEs) such as "bigger than" and "more oranges than" are highly ambiguous, and their meaning is context dependent. Thus, they pose probl...
Duane E. Olawsky
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
14 years 5 days ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
VLDB
2005
ACM
180views Database» more  VLDB 2005»
14 years 1 months ago
Cache-conscious Frequent Pattern Mining on a Modern Processor
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern min...
Amol Ghoting, Gregory Buehrer, Srinivasan Parthasa...
ICCV
2011
IEEE
12 years 8 months ago
2D-3D Fusion for Layer Decomposition of Urban Facades
We present a method for fusing two acquisition modes, 2D photographs and 3D LiDAR scans, for depth-layer decomposition of urban facades. The two modes have complementary character...
Yangyan Li, Qian Zheng, Andrei Sharf, Daniel Cohen...