Sciweavers

9849 search results - page 336 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
241
Voted
ISNN
2004
Springer
16 years 24 days ago
Sparse Bayesian Learning Based on an Efficient Subset Selection
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
Liefeng Bo, Ling Wang, Licheng Jiao
185
Voted
SIGMOD
1998
ACM
93views Database» more  SIGMOD 1998»
15 years 11 months ago
Efficiently Mining Long Patterns from Databases
We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In c...
Roberto J. Bayardo Jr.
IJIT
2004
15 years 8 months ago
Synthesis of Logic Circuits Using Fractional-Order Dynamic Fitness Functions
This paper analyses the performance of a genetic algorithm using a new concept, namely a fractional-order dynamic fitness function, for the synthesis of combinational logic circuit...
Cecília Reis, José António Te...
EOR
2007
76views more  EOR 2007»
15 years 7 months ago
Lower bounds and heuristics for the Windy Rural Postman Problem
In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains a big number of important Arc Routin...
Enrique Benavent, Alessandro Carrotta, Angel Corbe...
AMC
2007
114views more  AMC 2007»
15 years 7 months ago
Software complexity: A statistical case study through insertion sort
: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
Anchala Kumari, Soubhik Chakraborty