Sciweavers

842 search results - page 79 / 169
» Numerical Analysis on a Quantum Computer
Sort
View
JACM
2000
119views more  JACM 2000»
13 years 7 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
CONSTRAINTS
1999
105views more  CONSTRAINTS 1999»
13 years 7 months ago
Algorithmic Power from Declarative Use of Redundant Constraints
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
Maarten H. van Emden
SYMMETRY
2010
90views more  SYMMETRY 2010»
13 years 2 months ago
Orientational Sampling Schemes Based on Four Dimensional Polytopes
Abstract: The vertices of regular four-dimensional polytopes are used to generate sets of uniformly distributed three-dimensional rotations, which are provided as tables of Euler a...
Salvatore Mamone, Giuseppe Pileio, Malcolm H. Levi...
RECOMB
2004
Springer
14 years 8 months ago
Multiple organism gene finding by collapsed gibbs sampling
The Gibbs sampling method has been widely used for sequence analysis after it was successfully applied to the problem of identifying regulatory motif sequences upstream of genes. ...
Sourav Chatterji, Lior Pachter
ICNS
2007
IEEE
14 years 2 months ago
Data fusion algorithms for network anomaly detection: classification and evaluation
In this paper, the problem of discovering anomalies in a large-scale network based on the data fusion of heterogeneous monitors is considered. We present a classification of anoma...
Vasilis Chatzigiannakis, Georgios Androulidakis, K...