Sciweavers

372 search results - page 41 / 75
» On Finding Small 2-Generating Sets
Sort
View
ISCI
2008
116views more  ISCI 2008»
14 years 12 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
MAM
2006
124views more  MAM 2006»
14 years 11 months ago
Design optimization and space minimization considering timing and code size via retiming and unfolding
The increasingly complicated DSP processors and applications with strict timing and code size constraints require design automation tools to consider multiple optimizations such a...
Qingfeng Zhuge, Chun Xue, Zili Shao, Meilin Liu, M...
CORR
2002
Springer
92views Education» more  CORR 2002»
14 years 11 months ago
Source Routing and Scheduling in Packet Networks
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...
Matthew Andrews, Antonio Fernández, Ashish ...
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
14 years 9 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
JIB
2006
106views more  JIB 2006»
14 years 12 months ago
A structural keystone for drug design
3D-structures of proteins and potential ligands are the cornerstones of rational drug design. The first brick to build upon is selecting a protein target and finding out whether b...
Kristian Rother, Mathias Dunkel, Elke Michalsky, S...