Sciweavers

3837 search results - page 221 / 768
» Learning Approximate Consistencies
Sort
View
MOBIHOC
2007
ACM
16 years 6 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
FOCS
2004
IEEE
15 years 11 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
VC
2010
207views more  VC 2010»
15 years 5 months ago
Protrusion-oriented 3D mesh segmentation
Abstract In this paper, we present a segmentation algorithm which partitions a mesh based on the premise that a 3D object consists of a core body and its constituent protrusible pa...
Alexander Agathos, Ioannis Pratikakis, Stavros J. ...
IDA
2009
Springer
16 years 1 months ago
Canonical Dual Approach to Binary Factor Analysis
Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in B...
Ke Sun, Shikui Tu, David Yang Gao, Lei Xu
COLT
2003
Springer
16 years 12 days ago
Maximum Margin Algorithms with Boolean Kernels
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
Roni Khardon, Rocco A. Servedio