Sciweavers

268 search results - page 37 / 54
» Cleaning Interval Graphs
Sort
View
ICDE
2006
IEEE
130views Database» more  ICDE 2006»
15 years 11 months ago
MIC Framework: An Information-Theoretic Approach to Quantitative Association Rule Mining
We propose a framework, called MIC, which adopts an information-theoretic approach to address the problem of quantitative association rule mining. In our MIC framework, we first d...
Yiping Ke, James Cheng, Wilfred Ng
EACL
1993
ACL Anthology
14 years 11 months ago
Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
Alain Lecomte
ACTAC
2007
69views more  ACTAC 2007»
14 years 10 months ago
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
Dávid Hanák, Nagarajan Kandasamy
85
Voted
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
14 years 10 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
VLSISP
2002
112views more  VLSISP 2002»
14 years 9 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai