Sciweavers

16430 search results - page 509 / 3286
» On Computable Tree Functions
Sort
View
MP
1998
117views more  MP 1998»
15 years 6 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
MSR
2006
ACM
16 years 29 days ago
Predicting defect densities in source code files with decision tree learners
With the advent of open source software repositories the data available for defect prediction in source files increased tremendously. Although traditional statistics turned out t...
Patrick Knab, Martin Pinzger, Abraham Bernstein
ISPD
2003
ACM
133views Hardware» more  ISPD 2003»
16 years 8 days ago
Optimal minimum-delay/area zero-skew clock tree wire-sizing in pseudo-polynomial time
In 21st-Century VLSI design, clocking plays crucial roles for both performance and timing convergence. Due to their non-convex nature, optimal minimum-delay/area zero-skew wire-si...
Jeng-Liang Tsai, Tsung-Hao Chen, Charlie Chung-Pin...
ADC
2003
Springer
182views Database» more  ADC 2003»
16 years 7 days ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
CIKM
2006
Springer
15 years 10 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...