Sciweavers

7129 search results - page 784 / 1426
» Approximation Algorithms for Treewidth
Sort
View
DAM
2008
135views more  DAM 2008»
15 years 6 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
DCG
2008
86views more  DCG 2008»
15 years 6 months ago
Reconstruction Using Witness Complexes
We present a novel reconstruction algorithm that, given an input point set sampled from an object S, builds a one-parameter family of complexes that approximate S at different sca...
Leonidas J. Guibas, Steve Oudot
JGTOOLS
2006
72views more  JGTOOLS 2006»
15 years 6 months ago
Efficient Generation of Poisson-Disk Sampling Patterns
Poisson Disk sampling patterns are of interest to the graphics community because their blue-noise properties are desirable in sampling patterns for rendering, illumination, and ot...
Thouis R. Jones
PC
2008
119views Management» more  PC 2008»
15 years 6 months ago
Atomic wavefunction initialization in ab initio
We present a distributed scheme for initialization from atomic wavefunctions in ab initio molecular dynamics simulations. Good initial guesses for approximate wavefunctions are ve...
Constantine Bekas, Alessandro Curioni, Wanda Andre...
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
15 years 6 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof