Sciweavers

1092 search results - page 189 / 219
» Convex Methods for Transduction
Sort
View
COMPGEOM
1999
ACM
14 years 1 days ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...
LATIN
1998
Springer
13 years 12 months ago
Short and Smooth Polygonal Paths
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
James Abello, Emden R. Gansner
COLT
2007
Springer
13 years 11 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
DAC
2010
ACM
13 years 11 months ago
Representative path selection for post-silicon timing prediction under variability
The identification of speedpaths is required for post-silicon (PS) timing validation, and it is currently becoming timeconsuming due to manufacturing variations. In this paper we...
Lin Xie, Azadeh Davoodi
ICC
2007
IEEE
168views Communications» more  ICC 2007»
13 years 11 months ago
Analysis and Optimization of Power Control in Multiuser Cognitive Wireless Networks
In this paper, the problem about power control in multiuser cognitive networks is addressed. The scenario we study is a heterogeneous network, where multiple cognitive (without the...
Peng Cheng, Guanding Yu, Zhaoyang Zhang, Peiliang ...