Sciweavers

8294 search results - page 161 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
156
Voted
DMIN
2006
137views Data Mining» more  DMIN 2006»
15 years 6 months ago
Discovering of Frequent Itemsets with CP-mine Algorithm
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
Nuansri Denwattana, Yutthana Treewai
136
Voted
EURODAC
1994
IEEE
128views VHDL» more  EURODAC 1994»
15 years 9 months ago
A component selection algorithm for high-performance pipelines
The use of a realistic component library with multiple implementations of operators, results in cost ef cient designs; slow components can then be used on non-critical paths and t...
Smita Bakshi, Daniel D. Gajski
SIGSOFT
2007
ACM
16 years 5 months ago
Mining API patterns as partial orders from source code: from usage scenarios to specifications
A software system interacts with third-party libraries through various APIs. Using these library APIs often needs to follow certain usage patterns. Furthermore, ordering rules (sp...
Mithun Acharya, Tao Xie, Jian Pei, Jun Xu
CPM
2009
Springer
131views Combinatorics» more  CPM 2009»
15 years 8 months ago
Linear Time Suffix Array Construction Using D-Critical Substrings
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
Ge Nong, Sen Zhang, Wai Hong Chan
176
Voted
SIGMOD
2010
ACM
232views Database» more  SIGMOD 2010»
15 years 5 months ago
Optimizing content freshness of relations extracted from the web using keyword search
An increasing number of applications operate on data obtained from the Web. These applications typically maintain local copies of the web data to avoid network latency in data acc...
Mohan Yang, Haixun Wang, Lipyeow Lim, Min Wang