Sciweavers

4009 search results - page 703 / 802
» Clustering on Complex Graphs
Sort
View
ICCAD
2004
IEEE
94views Hardware» more  ICCAD 2004»
16 years 1 months ago
Timing macro-modeling of IP blocks with crosstalk
With the increase of design complexities and the decrease of minimal feature sizes, IP reuse is becoming a common practice while crosstalk is becoming a critical issue that must b...
Ruiming Chen, Hai Zhou
WWW
2010
ACM
15 years 11 months ago
Matrix "Bit" loaded: a scalable lightweight join query processor for RDF data
The Semantic Web community, until now, has used traditional database systems for the storage and querying of RDF data. The SPARQL query language also closely follows SQL syntax. A...
Medha Atre, Vineet Chaoji, Mohammed J. Zaki, James...
DSD
2009
IEEE
105views Hardware» more  DSD 2009»
15 years 11 months ago
Design of a Highly Dependable Beamforming Chip
—As CMOS process technology advances towards 32nm, SoC complexity continuously grows but its dependability significantly decreases. In this paper, a beamforming chip 1 is designe...
Xiao Zhang, Hans G. Kerkhoff
ICTAI
2009
IEEE
15 years 11 months ago
EBLearn: Open-Source Energy-Based Learning in C++
Energy-based learning (EBL) is a general framework to describe supervised and unsupervised training methods for probabilistic and non-probabilistic factor graphs. An energy-based ...
Pierre Sermanet, Koray Kavukcuoglu, Yann LeCun
INFOCOM
2009
IEEE
15 years 11 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter