Data Structures | Sciweavers

16

ESA
2010
Springer

140views Algorithms» more ESA 2010»

A Unified Approach to Approximate Proximity Searching

13 years 5 months ago

The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...

Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...

claim paper

Read More »

18

click to vote

NIPS
1990

266views Information Technology» more NIPS 1990»

Bumptrees for Efficient Function, Constraint and Classification Learning

13 years 5 months ago

Download www.icsi.berkeley.edu

A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...

Stephen M. Omohundro

claim paper

Read More »

9

click to vote

SODA
1994
ACM

105views Algorithms» more SODA 1994»

Approximate Data Structures with Applications

13 years 5 months ago

Download www.ittc.ku.edu

Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...

Yossi Matias, Jeffrey Scott Vitter, Neal E. Young

claim paper

Read More »

13

click to vote

LFP
1994

113views more LFP 1994»

Collecting More Garbage

13 years 5 months ago

Download pop-art.inrialpes.fr

We present a method, adapted to polymorphically typed functional languages, to detect and collect more garbage than existing GCs. It can be applied to strict or lazy higher order ...

Pascal Fradet

claim paper

Read More »

16

click to vote

UAI
1997

129views Artificial Intelligence» more UAI 1997»

Nonuniform Dynamic Discretization in Hybrid Networks

13 years 5 months ago

Download ai.stanford.edu

We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...

Alexander V. Kozlov, Daphne Koller

claim paper

Read More »

12

click to vote

SODA
1997
ACM

144views Algorithms» more SODA 1997»

Methods for Achieving Fast Query Times in Point Location Data Structures

13 years 5 months ago

Download www.ics.uci.edu

Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...

Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...

claim paper

Read More »

27

click to vote

WDAS
2000

154views Distributed And Parallel Com...» more WDAS 2000»

Scalable Distributed Data Structures for High-Performance Databases

13 years 5 months ago

Download user.it.uu.se

Present databases, whether on centralized or parallel DBMSs, do not deal well with scalability. We present an architecture for Wintel multicomputers termed AMOS-SDDS, coupling a h...

Yakham Ndiaye, Aly Wane Diene, Witold Litwin, Tore...

claim paper

Read More »

11

click to vote

SODA
1998
ACM

113views Algorithms» more SODA 1998»

Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs

13 years 5 months ago

Download www.ics.uci.edu

We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...

David Eppstein

claim paper

Read More »

24

click to vote

NDDL
2003

132views Digital Library» more NDDL 2003»

High-Level Data Races

13 years 5 months ago

Download ti.arc.nasa.gov

Data races are a common problem in concurrent and multi-threaded programming. They are hard to detect without proper tool support. Despite the successful application of these tools...

Cyrille Artho, Klaus Havelund, Armin Biere

claim paper

Read More »

8

click to vote

WSCG
2004

158views more WSCG 2004»

JaGrLib: Library for Computer Graphics Education

13 years 5 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers