Sciweavers

1879 search results - page 194 / 376
» Computational geometry algorithms library
Sort
View
IJCAI
1993
15 years 6 months ago
Anytime Sensing Planning and Action: A Practical Model for Robot Control
Anytime algorithms, whose quality of results improves gradually as computation time increases, provide useful performance components for timecritical planning and control of robot...
Shlomo Zilberstein, Stuart J. Russell
DAC
1999
ACM
16 years 6 months ago
A Multiscale Method for Fast Capacitance Extraction
The many levels of metal used in aggressive deep submicron process technologies has made fast and accurate capacitance extraction of complicated 3-D geometries of conductors essen...
Johannes Tausch, Jacob K. White
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
15 years 12 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland
BMCBI
2006
110views more  BMCBI 2006»
15 years 5 months ago
CpGcluster: a distance-based algorithm for CpG-island detection
Background: Despite their involvement in the regulation of gene expression and their importance as genomic markers for promoter prediction, no objective standard exists for defini...
Michael Hackenberg, Christopher Previti, Pedro Lui...
COMPGEOM
2006
ACM
15 years 9 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi