Sciweavers

216 search results - page 15 / 44
» Fast Optimal Algorithms for Computing All the Repeats in a S...
Sort
View
143
Voted
CSR
2006
Springer
15 years 7 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 3 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
126
Voted
EDOC
2006
IEEE
15 years 7 months ago
A Fast and Efficient Route Finding Method for Car Navigation Systems with Neural Networks
In this paper we have proposed a new route finding method for car navigation systems meanwhile, have utilized learning power and high speed of neural networks in our proposed meth...
Mehdi Hashemzadeh
CEC
2008
IEEE
15 years 10 months ago
A particle swarm optimizer with lifespan for global optimization on multimodal functions
—The particle swarm optimizer (PSO) is a popular computing technique of swarm intelligence, known for its fast convergence speed and easy implementation. All the particles in the...
Jun Zhang, Ying Lin
117
Voted
ICCAD
1997
IEEE
112views Hardware» more  ICCAD 1997»
15 years 7 months ago
Circuit optimization via adjoint Lagrangians
The circuit tuning problem is best approached by means of gradient-based nonlinear optimization algorithms. For large circuits, gradient computation can be the bottleneck in the o...
Andrew R. Conn, Ruud A. Haring, Chandramouli Viswe...