Sciweavers

557 search results - page 99 / 112
» On the set multi-cover problem in geometric settings
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
Envelope surfaces
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
Nico Kruithof, Gert Vegter
ICCD
2006
IEEE
86views Hardware» more  ICCD 2006»
14 years 4 months ago
Interconnect Matching Design Rule Inferring and Optimization through Correlation Extraction
— New back-end design for manufacturability rules have brought guarantee rules for interconnect matching. These rules indicate a certain capacitance matching guarantee given spac...
Rasit Onur Topaloglu, Andrew B. Kahng
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 9 months ago
Semi-Supervised Learning Based on Semiparametric Regularization
Semi-supervised learning plays an important role in the recent literature on machine learning and data mining and the developed semisupervised learning techniques have led to many...
Zhen Guo, Zhongfei (Mark) Zhang, Eric P. Xing, Chr...
NIPS
2001
13 years 9 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
PAMI
2007
154views more  PAMI 2007»
13 years 7 months ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...