Sciweavers

1092 search results - page 56 / 219
» Convex Methods for Transduction
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 10 months ago
Non-Negative Matrix Factorization, Convexity and Isometry
Traditional Non-Negative Matrix Factorization (NMF) [19] is a successful algorithm for decomposing datasets into basis function that have reasonable interpretation. One problem of...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...
JPDC
2006
148views more  JPDC 2006»
13 years 10 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
BMCBI
2004
93views more  BMCBI 2004»
13 years 10 months ago
Predicting binding sites of hydrolase-inhibitor complexes by combining several methods
Background: Protein-protein interactions play a critical role in protein function. Completion of many genomes is being followed rapidly by major efforts to identify interacting pr...
Taner Z. Sen, Andrzej Kloczkowski, Robert L. Jerni...
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
13 years 10 months ago
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
Naama Mayer, Efi Fogel, Dan Halperin
JMLR
2012
12 years 16 days ago
Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
Garvesh Raskutti, Martin J. Wainwright, Bin Yu