Sciweavers

287 search results - page 31 / 58
» Optimal Histograms with Quality Guarantees
Sort
View
GD
2005
Springer
14 years 3 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
EUROGRAPHICS
2010
Eurographics
14 years 7 months ago
Human Motion Synthesis with Optimization-based Graphs
Continuous constrained optimization is a powerful tool for synthesizing novel human motion segments that are short. Graph-based motion synthesis methods such as motion graphs and ...
Cheng Ren, Liming Zhao, Alla Safonova
QSHINE
2005
IEEE
14 years 3 months ago
Utility-based Adaptive Resource Allocation in Hybrid Wireless Networks
Service availability in wireless networks is highly dependent on efficient resource allocation and guaranteed Quality of Service (QoS) amid overloads and failures. This paper add...
Calin Curescu, Simin Nadjm-Tehrani, Bing Cao, Tere...
JMLR
2006
145views more  JMLR 2006»
13 years 9 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
14 years 6 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris