Sciweavers

455 search results - page 87 / 91
» On Trees and Noncrossing Partitions
Sort
View
ICML
2004
IEEE
14 years 8 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
ECCV
2008
Springer
14 years 6 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
ICCAD
2006
IEEE
304views Hardware» more  ICCAD 2006»
14 years 4 months ago
Trunk decomposition based global routing optimization
We present global routing optimization methods which are not based on rip-up and re-route framework. In particular, the routing optimization is based on trunk decomposition [13] o...
Devang Jariwala, John Lillis
IPSN
2009
Springer
14 years 2 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
14 years 2 months 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