Sciweavers

1110 search results - page 185 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
ICCAD
1994
IEEE
106views Hardware» more  ICCAD 1994»
15 years 2 months ago
On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
Yu-Liang Wu, Douglas Chang
AINA
2008
IEEE
15 years 24 days ago
A Communication-Efficient Distributed Clustering Algorithm for Sensor Networks
Sensor networks usually generate continuous stream of data over time. Clustering sensor data as a core task of mining sensor data plays an essential role in analytical application...
Amirhosein Taherkordi, Reza Mohammadi, Frank Elias...
JAIR
2006
87views more  JAIR 2006»
14 years 10 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy
DAC
2009
ACM
15 years 11 months ago
Handling don't-care conditions in high-level synthesis and application for reducing initialized registers
Don't-care conditions provide additional flexibility in logic synthesis and optimization. However, most work only focuses on the gate level because it is difficult to handle ...
Hong-Zu Chou, Kai-Hui Chang, Sy-Yen Kuo
WWW
2009
ACM
15 years 11 months ago
Tag-oriented document summarization
Social annotations on a Web document are highly generalized description of topics contained in that page. Their tagged frequency indicates the user attentions with various degrees...
Junyan Zhu, Can Wang, Xiaofei He, Jiajun Bu, Chun ...