Sciweavers

203 search results - page 28 / 41
» On Inducing Polygons and Related Problems
Sort
View
JMLR
2011
192views more  JMLR 2011»
13 years 2 months ago
Minimum Description Length Penalization for Group and Multi-Task Sparse Learning
We propose a framework MIC (Multiple Inclusion Criterion) for learning sparse models based on the information theoretic Minimum Description Length (MDL) principle. MIC provides an...
Paramveer S. Dhillon, Dean P. Foster, Lyle H. Unga...
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
14 years 29 days ago
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
Pekka Orponen, Satu Elisa Schaeffer
GG
2004
Springer
14 years 26 days ago
Embedding in Switching Classes with Skew Gains
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...
ICRA
2000
IEEE
100views Robotics» more  ICRA 2000»
13 years 12 months ago
Robots Can Teach People How to Move Their Arm
We describe a new theoretical framework for robot-aided training of arm movements. This framework is based on recent studies of motor adaptation in human subjects and on general c...
Ferdinando A. Mussa-Ivaldi, James L. Patton
CVPR
2010
IEEE
13 years 7 months ago
Learning kernels for variants of normalized cuts: Convex relaxations and applications
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
Lopamudra Mukherjee, Vikas Singh, Jiming Peng, Chr...