Sciweavers

129 search results - page 19 / 26
» A Graph Reduction Method for 2D Snake Problems
Sort
View
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
13 years 11 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
COMAD
2009
13 years 8 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey
EDBT
2012
ACM
247views Database» more  EDBT 2012»
11 years 10 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
ICCAD
1999
IEEE
125views Hardware» more  ICCAD 1999»
13 years 12 months ago
Direct synthesis of timed asynchronous circuits
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
Sung Tae Jung, Chris J. Myers
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 8 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng