Sciweavers

251 search results - page 34 / 51
» Constructive Linear Time Algorithms for Branchwidth
Sort
View
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 1 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
BIRTHDAY
1994
Springer
15 years 1 months ago
Generalizing Cook's Transformation to Imperative Stack Programs
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
Nils Andersen, Neil D. Jones
VISUALIZATION
1998
IEEE
15 years 1 months ago
Hierarchical volume analysis and visualization based on morphological operators
One common problem in the practical application of volume visualization is the proper choice of transfer functions in order to color different parts of the volume meaningfully. Th...
Christoph Lürig, Thomas Ertl
CSDA
2006
108views more  CSDA 2006»
14 years 9 months ago
Repeated median and hybrid filters
Standard median filters preserve abrupt shifts (edges) and remove impulsive noise (outliers) from a constant signal but they deteriorate in trend periods. Finite impulse response ...
Roland Fried, Thorsten Bernholt, Ursula Gather
ICFP
2007
ACM
15 years 9 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson