Sciweavers

1813 search results - page 128 / 363
» Calculi of Approximation Spaces
Sort
View
ISAAC
2004
Springer
135views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Geometric Optimization Problems Over Sliding Windows
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
Timothy M. Chan, Bashir S. Sadjad
PCI
2001
Springer
15 years 10 months ago
An Experimental Evaluation of a Monte-Carlo Algorithm for Singular Value Decomposition
We demonstrate that an algorithm proposed by Drineas et. al. in [7] to approximate the singular vectors/values of a matrix A, is not only of theoretical interest but also a fast, v...
Petros Drineas, Eleni Drinea, Patrick S. Huggins
EURODAC
1994
IEEE
110views VHDL» more  EURODAC 1994»
15 years 10 months ago
Symbolic exploration of large circuits with enhanced forward/backward traversals
Symbolic state space exploration techniques for Finite State Machines (FSMs) are a major recent result in CAD for VLSI. Most of them are exact and based on forward traversal, but ...
Gianpiero Cabodi, Paolo Camurati, Stefano Quer
BIBM
2009
IEEE
118views Bioinformatics» more  BIBM 2009»
15 years 10 months ago
Inexact Local Alignment Search over Suffix Arrays
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
Mohammadreza Ghodsi, Mihai Pop
APN
2006
Springer
15 years 10 months ago
A New Approach to the Evaluation of Non Markovian Stochastic Petri Nets
Abstract. In this work, we address the problem of transient and steadystate analysis of a stochastic Petri net which includes non Markovian distributions with a finite support but ...
Serge Haddad, Lynda Mokdad, Patrice Moreaux