Sciweavers

3958 search results - page 316 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
ISNN
2007
Springer
16 years 26 days ago
Neural Networks Training with Optimal Bounded Ellipsoid Algorithm
Abstract. Compared to normal learning algorithms, for example backpropagation, the optimal bounded ellipsoid (OBE) algorithm has some better properties, such as faster convergence,...
José de Jesús Rubio, Wen Yu
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 7 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
IPPS
2003
IEEE
15 years 12 months ago
Task Pool Teams for Implementing Irregular Algorithms on Clusters of SMPs
The characteristics of irregular algorithms make a parallel implementation difficult, especially for PC clusters or clusters of SMPs. These characteristics may include an unpredi...
Judith Hippold, Gudula Rünger
DATE
2000
IEEE
112views Hardware» more  DATE 2000»
15 years 11 months ago
Quantitative Comparison of Power Management Algorithms
Dynamic power management saves power by shutting down idle devices. Several management algorithms have been proposed and demonstrated effective in certain applications. We quantit...
Yung-Hsiang Lu, Eui-Young Chung, Tajana Simunic, G...
ISSTA
2009
ACM
16 years 1 months ago
Identifying bug signatures using discriminative graph mining
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
Hong Cheng, David Lo, Yang Zhou, Xiaoyin Wang, Xif...