Sciweavers

Share
TVCG
2010
153views more  TVCG 2010»
8 years 2 months ago
Parallel View-Dependent Level-of-Detail Control
—We present a scheme for view-dependent level-of-detail control that is implemented entirely on programmable graphics hardware. Our scheme selectively refines and coarsens an ar...
Liang Hu, Pedro V. Sander, Hugues Hoppe
SPIRE
2010
Springer
8 years 2 months ago
Colored Range Queries and Document Retrieval
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
Travis Gagie, Gonzalo Navarro, Simon J. Puglisi
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
8 years 2 months ago
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
Gerth Stølting Brodal, Erik D. Demaine, Jer...
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
8 years 2 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola
ML
2007
ACM
101views Machine Learning» more  ML 2007»
8 years 3 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
TPDS
1998
122views more  TPDS 1998»
8 years 4 months ago
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
Isidore Rigoutsos, Alex Delis
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
8 years 4 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
CORR
1999
Springer
222views Education» more  CORR 1999»
8 years 4 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
JCISE
2002
117views more  JCISE 2002»
8 years 4 months ago
Memory Analysis of Solid Model Representations for Heterogeneous Objects
Methods to represent and exchange parts consisting of Functionally Graded Material (FGM) for Solid Freeform Fabrication (SFF) with Local Composition Control (LCC) are evaluated ba...
Todd R. Jackson, Wonjoon Cho, Nicholas M. Patrikal...
CACM
2000
97views more  CACM 2000»
8 years 4 months ago
Generalizing by Removing Detail
A long-standing goal of the programming by demonstration research community is to enable people to construct programs by showing how the desired programs should work on sample inp...
Kenneth M. Kahn
books