Sciweavers

ESA
2010
Springer
140views Algorithms» more  ESA 2010»
14 years 18 days ago
A Unified Approach to Approximate Proximity Searching
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...
NIPS
1990
14 years 20 days ago
Bumptrees for Efficient Function, Constraint and Classification Learning
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
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
14 years 24 days ago
Approximate Data Structures with Applications
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
LFP
1994
113views more  LFP 1994»
14 years 24 days ago
Collecting More Garbage
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
UAI
1997
14 years 25 days ago
Nonuniform Dynamic Discretization in Hybrid Networks
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
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
14 years 25 days ago
Methods for Achieving Fast Query Times in Point Location Data Structures
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...
WDAS
2000
14 years 25 days ago
Scalable Distributed Data Structures for High-Performance Databases
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...
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
14 years 25 days ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
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
NDDL
2003
14 years 26 days ago
High-Level Data Races
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
WSCG
2004
158views more  WSCG 2004»
14 years 26 days ago
JaGrLib: Library for Computer Graphics Education
This article describes JaGrLib
Josef Pelikán, Jan Kostlivý