Sciweavers

11214 search results - page 64 / 2243
» Just-in-time data structures
Sort
View
COMGEO
2007
ACM
13 years 10 months ago
A package for exact kinetic data structures and sweepline algorithms
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
Daniel Russel, Menelaos I. Karavelas, Leonidas J. ...
IPM
2006
167views more  IPM 2006»
13 years 10 months ago
Browsing mixed structured and unstructured data
Both structured and unstructured data, as well as structured data representing several different types of tuples, may be integrated into a single list for browsing or retrieval. D...
Robert M. Losee
CCCG
2008
13 years 11 months ago
Data Structures for Restricted Triangular Range Searching
We present data structures for triangular emptiness and reporting queries for a planar point set, where the query triangle contains the origin. The data structures use near-linear...
Mashhood Ishaque, Diane L. Souvaine, Nadia Benbern...
JSW
2007
66views more  JSW 2007»
13 years 9 months ago
Implementing Model-Based Data Structures using Transient Model Extensions
— Software is often constructed using a layered approach to encapsulate various functionality in corresponding layers. Individual requirements of each layer demand layer specifi...
Michael Thonhauser, Gernot Schmoelzer, Christian K...
SPIRE
2005
Springer
14 years 3 months ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi