Sciweavers

2745 search results - page 3 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
14 years 7 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
Sean Hallgren
VLSID
2000
IEEE
164views VLSI» more  VLSID 2000»
13 years 11 months ago
A Fast Algorithm for Computing the Euler Number of an Image and its VLSI Implementation
Digital images are convenient media for describing and storing spatial, temporal, spectral, and physical components of information contained in a variety of domains(e.g. aerial/sa...
Sabyasachi Dey, Bhargab B. Bhattacharya, Malay Kum...
BMCBI
2010
134views more  BMCBI 2010»
13 years 7 months ago
R-Gada: a fast and flexible pipeline for copy number analysis in association studies
Background: Genome-wide association studies (GWAS) using Copy Number Variation (CNV) are becoming a central focus of genetic research. CNVs have successfully provided target genom...
Roger Pique-Regi, Alejandro Cáceres, Juan R...
ICVGIP
2008
13 years 8 months ago
Fast, Processor-Cardinality Agnostic PRNG with a Tracking Application
As vision algorithms mature with increasing inspiration from the learning community, statistically independent pseudo random number generation (PRNG) becomes increasingly importan...
Andrew Janowczyk, Sharat Chandran, Srinivas Aluru
WABI
2001
Springer
124views Bioinformatics» more  WABI 2001»
13 years 11 months ago
Computing Linking Numbers of a Filtration
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
Herbert Edelsbrunner, Afra Zomorodian