Sciweavers

736 search results - page 79 / 148
» A dynamic data structure for approximate range searching
Sort
View
SIGGRAPH
2000
ACM
14 years 1 months ago
Dynamically reparameterized light fields
This research further develops the light field and lumigraph imagebased rendering methods and extends their utility. We present alternate parameterizations that permit 1) interac...
Aaron Isaksen, Leonard McMillan, Steven J. Gortler
IMC
2005
ACM
14 years 2 months ago
Improving Sketch Reconstruction Accuracy Using Linear Least Squares Method
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...
Gene Moo Lee, Huiya Liu, Young Yoon, Yin Zhang
BIBE
2007
IEEE
114views Bioinformatics» more  BIBE 2007»
14 years 3 months ago
A Hierarchical Grow-and-Match Algorithm for Backbone Resonance Assignments Given 3D Structure
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
Fei Xiong, Chris Bailey-Kellogg
DASFAA
2008
IEEE
163views Database» more  DASFAA 2008»
14 years 3 months ago
Automated Data Discovery in Similarity Score Queries
A vast amount of information is being stored in scientific databases on the web. The dynamic nature of the scientific data, the cost of providing an up-to-date snapshot of the wh...
Fatih Altiparmak, Ali Saman Tosun, Hakan Ferhatosm...
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 1 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie