Sciweavers

280 search results - page 17 / 56
» New Algorithms for Enumerating All Maximal Cliques
Sort
View
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
15 years 6 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
CC
2009
Springer
15 years 2 months ago
Scheduling Tasks to Maximize Usage of Aggregate Variables in Place
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...
Samah Abu-Mahmeed, Cheryl McCosh, Zoran Budimlic, ...
CIAC
2003
Springer
110views Algorithms» more  CIAC 2003»
15 years 2 months ago
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete
In the Art Gallery problem, given is a polygonal gallery and the goal is to guard the gallery’s interior or walls with a number of guards that must be placed strategically in the...
Euripides Markou, Stathis Zachos, Christodoulos Fr...
FPGA
2006
ACM
155views FPGA» more  FPGA 2006»
15 years 1 months ago
Improvements to technology mapping for LUT-based FPGAs
The paper presents several improvements to state-of-theart in FPGA technology mapping exemplified by a recent advanced technology mapper DAOmap [Chen and Cong, ICCAD `04]. Improve...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...
AAAI
2007
14 years 12 months ago
Computing Optimal Subsets
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shi...