Sciweavers

11211 search results - page 84 / 2243
» Rank-Sensitive Data Structures
Sort
View
105
Voted
COMGEO
2007
ACM
15 years 20 days 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»
15 years 19 days 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
73
Voted
CCCG
2008
15 years 2 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...
83
Voted
JSW
2007
66views more  JSW 2007»
15 years 16 days 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...
108
Voted
ECML
2007
Springer
15 years 6 months ago
Structure Learning of Probabilistic Relational Models from Incomplete Relational Data
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
Xiao-Lin Li, Zhi-Hua Zhou