Sciweavers

478 search results - page 45 / 96
» Context-Sensitive Dependency Pairs
Sort
View
TOG
2010
153views more  TOG 2010»
14 years 6 months ago
Content-adaptive parallax barriers: optimizing dual-layer 3D displays using low-rank light field factorization
We optimize automultiscopic displays built by stacking a pair of modified LCD panels. To date, such dual-stacked LCDs have used heuristic parallax barriers for view-dependent imag...
Douglas Lanman, Matthew Hirsch, Yunhee Kim, Ramesh...
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
14 years 9 months ago
Evaluating Statistical Tests for Within-Network Classifiers of Relational Data
Recently a number of modeling techniques have been developed for data mining and machine learning in relational and network domains where the instances are not independent and ide...
Jennifer Neville, Brian Gallagher, Tina Eliassi-Ra...
ICML
2007
IEEE
16 years 19 days ago
On learning with dissimilarity functions
We study the problem of learning a classification task in which only a dissimilarity function of the objects is accessible. That is, data are not represented by feature vectors bu...
Liwei Wang, Cheng Yang, Jufu Feng
ICCAD
2003
IEEE
105views Hardware» more  ICCAD 2003»
15 years 8 months ago
TAM Optimization for Mixed-Signal SOCs using Analog Test Wrappers
We present a new approach for TAM optimization and test scheduling in the modular testing of mixed-signal SOCs. A test planning approach for digital SOCs is extended to handle ana...
Anuja Sehgal, Sule Ozev, Krishnendu Chakrabarty
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
15 years 6 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku