Sciweavers

4541 search results - page 119 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ITICSE
1999
ACM
15 years 3 months ago
A strategy for managing content complexity in algorithm animation
Computer animation is an excellent medium for capturing the dynamic nature of data structure manipulations, and can be used to advantage in the teaching of algorithms and data str...
Linda Stern, Harald Søndergaard, Lee Naish
AINA
2009
IEEE
15 years 6 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
ADBIS
1994
Springer
87views Database» more  ADBIS 1994»
15 years 3 months ago
Variations of R-Tree Structure for Indexing of Spatial Objects
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
M. G. Martynov
STACS
2007
Springer
15 years 5 months ago
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
Costas Busch, Srikanta Tirthapura
MM
2000
ACM
98views Multimedia» more  MM 2000»
15 years 3 months ago
Determining computable scenes in films and their structures using audio-visual memory models
In this paper we present novel algorithms for computing scenes and within-scene structures in films. We begin by mapping insights from film-making rules and experimental results f...
Hari Sundaram, Shih-Fu Chang