Sciweavers

7 search results - page 1 / 2
» General Graph Refinement with Polynomial Delay
Sort
View
MLG
2007
Springer
13 years 11 months ago
General Graph Refinement with Polynomial Delay
Jan Ramon, Siegfried Nijssen
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
14 years 2 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
DIS
2007
Springer
13 years 8 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
DAC
2003
ACM
14 years 5 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...
BROADNETS
2006
IEEE
13 years 11 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...