Sciweavers

2498 search results - page 237 / 500
» Data Structures with Unpredictable Timing
Sort
View
ICCV
1995
IEEE
15 years 6 months ago
Better Optical Triangulation Through Spacetime Analysis
The standard methods for extracting range data from optical triangulation scanners are accurate only for planar objects of uniform reflectance illuminated by an incoherentsource....
Brian Curless, Marc Levoy
WSC
2007
15 years 4 months ago
Automatic generation of simulation models for semiconductor manufacturing
This article gives an overview of a framework for automatically generating large-scale simulation models from a domain specific problem definition data schema, here semiconductor ...
Ralph Mueller, Christos Alexopoulos, Leon F. McGin...
148
Voted
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 5 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
117
Voted
CSDA
2006
103views more  CSDA 2006»
15 years 2 months ago
LASS: a tool for the local analysis of self-similarity
The Hurst parameter H characterizes the degree of long-range dependence (and asymptotic selfsimilarity) in stationary time series. Many methods have been developed for the estimat...
Stilian Stoev, Murad S. Taqqu, Cheolwoo Park, Geor...
129
Voted
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
15 years 6 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter