Sciweavers

490 search results - page 26 / 98
» Practical Extensions to the IFDS Algorithm
Sort
View
ICDM
2005
IEEE
166views Data Mining» more  ICDM 2005»
14 years 3 months ago
An Algorithm for In-Core Frequent Itemset Mining on Streaming Data
Frequent itemset mining is a core data mining operation and has been extensively studied over the last decade. This paper takes a new approach for this problem and makes two major...
Ruoming Jin, Gagan Agrawal
STACS
2007
Springer
14 years 4 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
BMCBI
2006
112views more  BMCBI 2006»
13 years 10 months ago
Algorithms for incorporating prior topological information in HMMs: application to transmembrane proteins
Background: Hidden Markov Models (HMMs) have been extensively used in computational molecular biology, for modelling protein and nucleic acid sequences. In many applications, such...
Pantelis G. Bagos, Theodore D. Liakopoulos, Stavro...
TASE
2008
IEEE
13 years 10 months ago
New Hybrid Optimization Algorithms for Machine Scheduling Problems
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
Yunpeng Pan, Leyuan Shi
PLDI
2006
ACM
14 years 4 months ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann