Sciweavers

14704 search results - page 276 / 2941
» computing 2007
Sort
View
ICANN
2007
Springer
15 years 10 months ago
Event Detection and Localization in Mobile Robot Navigation Using Reservoir Computing
Abstract. Reservoir Computing (RC) uses a randomly created recurrent neural network where only a linear readout layer is trained. In this work, RC is used for detecting complex eve...
Eric A. Antonelo, Benjamin Schrauwen, Xavier Dutoi...
148
Voted
MLG
2007
Springer
15 years 10 months ago
Support Computation for Mining Frequent Subgraphs in a Single Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
127
Voted
SAMOS
2007
Springer
15 years 10 months ago
Low-Power Twiddle Factor Unit for FFT Computation
An integral part of FFT computation are the twiddle factors, which, in software implementations, are typically stored into RAM memory implying large memory footprint and power cons...
Teemu Pitkänen, Tero Partanen, Jarmo Takala
141
Voted
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
15 years 8 months ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos
COMPGEOM
2007
ACM
15 years 7 months ago
Computing the exact arrangement of circles on a sphere, with applications in structural biology: video
The Bentley-Ottmann (BO) algorithm, initially designed to report the intersection points of line-segments in the plane, is the prototypical sweep-line algorithm. This video presen...
Frédéric Cazals, Sébastien Lo...