Sciweavers

1629 search results - page 121 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
DATE
1999
IEEE
162views Hardware» more  DATE 1999»
15 years 2 months ago
MOCSYN: Multiobjective Core-Based Single-Chip System Synthesis
In this paper, we present a system synthesis algorithm, called MOCSYN, which partitions and schedules embedded system specifications to intellectual property cores in an integrate...
Robert P. Dick, Niraj K. Jha
ICCD
2007
IEEE
121views Hardware» more  ICCD 2007»
15 years 7 months ago
Fast power network analysis with multiple clock domains
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
Wanping Zhang, Ling Zhang, Rui Shi, He Peng, Zhi Z...
ICAS
2006
IEEE
143views Robotics» more  ICAS 2006»
15 years 4 months ago
Towards Autonomic Distribution of Existing Object Oriented Programs
By harnessing computational power of distributed heterogeneous resources, it is possible to build a large scale integrated system so that a centralized program is partitioned and ...
Debzani Deb, M. Muztaba Fuad, Michael J. Oudshoorn
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
15 years 10 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
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
15 years 4 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum