Sciweavers

2498 search results - page 306 / 500
» Data Structures with Unpredictable Timing
Sort
View
CN
2004
148views more  CN 2004»
15 years 6 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 6 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
ICDE
2008
IEEE
131views Database» more  ICDE 2008»
16 years 7 months ago
Parallel Evaluation of Composite Aggregate Queries
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
Lei Chen 0003, Christopher Olston, Raghu Ramakrish...
GIS
2007
ACM
16 years 7 months ago
Spatial and temporal analysis of pedestrian egress behavior and efficiency
This research reports on exploring analytical methodologies for spatio-temporal data of pedestrian egress dynamics in a crowded environment. The research objective is to spatially...
Atsushi Nara, Paul M. Torrens
WWW
2004
ACM
16 years 7 months ago
On mining webclick streams for path traversal patterns
Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user ac...
Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan