Sciweavers

3020 search results - page 477 / 604
» Optimal partition trees
Sort
View
ICML
2004
IEEE
16 years 7 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
IPSN
2009
Springer
16 years 1 months ago
Poster abstract: Enabling reliable and high-fidelity data center sensing
bstract: Enabling Reliable and High-Fidelity Data Center Sensing Chieh-Jan Mike Liang† , Jie Liu‡ , Liqian Luo , Andreas Terzis† † Johns Hopkins University ‡ Microsoft Re...
Chieh-Jan Mike Liang, Jie Liu, Liqian Luo, Andreas...
CODES
2008
IEEE
16 years 26 days ago
Don't forget memories: a case study redesigning a pattern counting ASIC circuit for FPGAs
Modern embedded compute platforms increasingly contain both microprocessors and field-programmable gate arrays (FPGAs). The FPGAs may implement accelerators or other circuits to s...
David Sheldon, Frank Vahid
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
16 years 15 days ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
VLSID
2006
IEEE
183views VLSI» more  VLSID 2006»
16 years 11 days ago
Design Challenges for High Performance Nano-Technology
This tutorial present the key aspects of design challenges and its solutions that are being experienced in VLSI design in the era of nano technology. The focus will be on design c...
Goutam Debnath, Paul J. Thadikaran