Sciweavers

10608 search results - page 61 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ECAI
2004
Springer
14 years 3 months ago
Learning Complex and Sparse Events in Long Sequences
The Hierarchical Hidden Markov Model (HHMM) is a well formalized tool suitable to model complex patterns in long temporal or spatial sequences. Even if effective algorithms are ava...
Marco Botta, Ugo Galassi, Attilio Giordana
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 11 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
TEC
2002
183views more  TEC 2002»
13 years 9 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
ASAP
2005
IEEE
99views Hardware» more  ASAP 2005»
14 years 3 months ago
Variable Radix Real and Complex Digit-Recurrence Division
We propose a digit-recurrence algorithm for division in real and complex number domains using a variable radix. The objective of the approach is to simplify the prescaling of the ...
Milos D. Ercegovac, Jean-Michel Muller
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
14 years 3 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur