Sciweavers

2304 search results - page 330 / 461
» On the Vulnerability of Large Graphs
Sort
View
WWW
2007
ACM
15 years 10 months ago
How NAGA uncoils: searching with entities and relations
Current keyword-oriented search engines for the World Wide Web do not allow specifying the semantics of queries. We address this limitation with NAGA1 , a new semantic search engi...
Gjergji Kasneci, Fabian M. Suchanek, Maya Ramanath...
VLSID
2002
IEEE
105views VLSI» more  VLSID 2002»
15 years 10 months ago
A Heuristic for Clock Selection in High-Level Synthesis
Clock selection has a significant impact on the performance and quality of designs in high-level synthesis. In most synthesis systems, a convenient value of the clock is chosen or...
J. Ramanujam, Sandeep Deshpande, Jinpyo Hong, Mahm...
ICALP
2009
Springer
15 years 10 months ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
Elena Losievskaja, Geir Agnarsson, Magnús M...
ICCAD
2007
IEEE
161views Hardware» more  ICCAD 2007»
15 years 7 months ago
Clustering based pruning for statistical criticality computation under process variations
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
Hushrav Mogal, Haifeng Qian, Sachin S. Sapatnekar,...
ICCAD
2007
IEEE
106views Hardware» more  ICCAD 2007»
15 years 7 months ago
A general model for performance optimization of sequential systems
Abstract— Retiming, c-slow retiming and recycling are different transformations for the performance optimization of sequential circuits. For retiming and c-slow retiming, differe...
Dmitry Bufistov, Jordi Cortadella, Michael Kishine...