Sciweavers

1151 search results - page 163 / 231
» Modelling Digital Circuits Problems with Set Constraints
Sort
View
SGP
2007
15 years 6 days ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
MICRO
2009
IEEE
160views Hardware» more  MICRO 2009»
15 years 4 months ago
Variation-tolerant non-uniform 3D cache management in die stacked multicore processor
Process variations in integrated circuits have significant impact on their performance, leakage and stability. This is particularly evident in large, regular and dense structures...
Bo Zhao, Yu Du, Youtao Zhang, Jun Yang 0002
SPAA
2004
ACM
15 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
CIKM
2008
Springer
14 years 11 months ago
A sparse gaussian processes classification framework for fast tag suggestions
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
Yang Song, Lu Zhang 0007, C. Lee Giles
SDM
2010
SIAM
149views Data Mining» more  SDM 2010»
14 years 11 months ago
Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization
Real-world relational data are seldom stationary, yet traditional collaborative filtering algorithms generally rely on this assumption. Motivated by our sales prediction problem, ...
Liang Xiong, Xi Chen, Tzu-Kuo Huang, Jeff Schneide...