Sciweavers

9871 search results - page 195 / 1975
» On the Structure of Low Sets
Sort
View
LATIN
2010
Springer
16 years 1 months ago
Layered Working-Set Trees
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
EMSOFT
2003
Springer
15 years 11 months ago
Generating Heap-Bounded Programs in a Functional Setting
Abstract. High-level programming languages offer significant expressivity but provide little or no guarantees about resource utilization. Resource-bounded languages provide stron...
Walid Taha, Stephan Ellner, Hongwei Xi
ISEC
2001
Springer
180views ECommerce» more  ISEC 2001»
15 years 11 months ago
i-Cube: A Tool-Set for the Dynamic Extraction and Integration of Web Data Content
Over the past decade the Internet has evolved into the largest public community in the world. It provides a wealth of data content and services in almost every field of science, t...
Frankie Poon, Kostas Kontogiannis
SDM
2007
SIAM
146views Data Mining» more  SDM 2007»
15 years 8 months ago
ROAM: Rule- and Motif-Based Anomaly Detection in Massive Moving Object Data Sets
With recent advances in sensory and mobile computing technology, enormous amounts of data about moving objects are being collected. One important application with such data is aut...
Xiaolei Li, Jiawei Han, Sangkyum Kim, Hector Gonza...
ICAD
2004
15 years 8 months ago
Data Set Selection for a Constrained Simple Sonification
Previous work on the production and test of various sonifications has shown that adding a sonification to an interface can assist the execution of a variety of operator tasks [1,2...
Shawn C. Garner