Sciweavers

1282 search results - page 85 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
IPPS
2008
IEEE
14 years 4 months ago
High-speed string searching against large dictionaries on the Cell/B.E. Processor
Our digital universe is growing, creating exploding amounts of data which need to be searched, protected and filtered. String searching is at the core of the tools we use to curb...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
GECCO
2003
Springer
14 years 3 months ago
Pruning Neural Networks with Distribution Estimation Algorithms
Abstract. This paper describes the application of four evolutionary algorithms to the pruning of neural networks used in classification problems. Besides of a simple genetic algor...
Erick Cantú-Paz
MOC
2011
13 years 1 months ago
Calculating cyclotomic polynomials
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...
Andrew Arnold, Michael B. Monagan
ASPDAC
2008
ACM
104views Hardware» more  ASPDAC 2008»
14 years 8 days ago
Low power clock buffer planning methodology in F-D placement for large scale circuit design
Traditionally, clock network layout is performed after cell placement. Such methodology is facing a serious problem in nanometer IC designs where people tend to use huge clock buff...
Yanfeng Wang, Qiang Zhou, Yici Cai, Jiang Hu, Xian...
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 4 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi