Sciweavers

9572 search results - page 348 / 1915
» Cover Algorithms and Their Combination
Sort
View
MOC
2000
85views more  MOC 2000»
15 years 6 months ago
Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior point algorithm f...
Liqun Qi, Defeng Sun
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
16 years 8 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
DATE
2009
IEEE
137views Hardware» more  DATE 2009»
16 years 1 months ago
aEqualized: A novel routing algorithm for the Spidergon Network On Chip
—We present the aEqualized routing algorithm: a novel algorithm for the Spidergon Network on Chip. AEqualized combines the well known aFirst and aLast algorithms proposed in lite...
Nicola Concer, Salvatore Iamundo, Luciano Bononi
CEC
2008
IEEE
16 years 1 months ago
Solving one-billion-bit Noisy OneMax problem using Estimation Distribution Algorithm with Arithmetic Coding
— This paper presents an algorithm which combines Estimation Distribution Algorithm with a chromosome compression scheme to solve large scale Noisy OneMax problem. The search spa...
Worasait Suwannik, Prabhas Chongstitvatana
WAW
2007
Springer
77views Algorithms» more  WAW 2007»
16 years 25 days ago
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
Sreenivas Gollapudi, Marc Najork, Rina Panigrahy