Sciweavers

906 search results - page 165 / 182
» Map graphs
Sort
View
ICCAD
1999
IEEE
115views Hardware» more  ICCAD 1999»
15 years 1 months ago
Fast performance analysis of bus-based system-on-chip communication architectures
This paper addresses the problem of efficient and accurate performance analysis to drive the exploration and design of bus-based System-on-Chip (SOC) communication architectures. ...
Kanishka Lahiri, Anand Raghunathan, Sujit Dey
101
Voted
NIPS
2001
14 years 11 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
TRECVID
2007
14 years 10 months ago
The Lowlands team at TRECVID 2007
Type Run Description MAP Official A UTen English ASR 0.0031 A UTt hs-t2-nm Top-2 concepts from t hs graph method with neighbor multiply 0.0137 A UTwiki-t2-nm Top-2 Wikipedia conc...
Robin Aly, Claudia Hauff, Willemijn Heeren, Djoerd...
90
Voted
BMCBI
2008
226views more  BMCBI 2008»
14 years 9 months ago
ProteoLens: a visual analytic tool for multi-scale database-driven biological network data mining
Background: New systems biology studies require researchers to understand how interplay among myriads of biomolecular entities is orchestrated in order to achieve high-level cellu...
Tianxiao Huan, Andrey Y. Sivachenko, Scott H. Harr...
DAM
2008
129views more  DAM 2008»
14 years 9 months ago
Minimum cost homomorphisms to semicomplete multipartite digraphs
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
Gregory Gutin, Arash Rafiey, Anders Yeo