Sciweavers

1542 search results - page 190 / 309
» Kernelization of packing problems
Sort
View
JMLR
2010
161views more  JMLR 2010»
14 years 8 months ago
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM
Kernel techniques have long been used in SVM to handle linearly inseparable problems by transforming data to a high dimensional space, but training and testing large data sets is ...
Yin-Wen Chang, Cho-Jui Hsieh, Kai-Wei Chang, Micha...
INFOCOM
2011
IEEE
14 years 5 months ago
Implications of device diversity for organic localization
—Many indoor localization methods are based on the association of 802.11 wireless RF signals from wireless access points (WAPs) with location labels. An “organic” RF position...
Jun-geun Park, Dorothy Curtis, Seth J. Teller, Jon...
103
Voted
MICCAI
2005
Springer
16 years 2 months ago
A Physical Model for DT-MRI Based Connectivity Map Computation
In this study we address the problem of extracting a robust connectivity metric for brain white matter. We defined the connectivity problem as an energy minimization task, by assoc...
Burak Acar, Erdem Yörük, Roland Bammer
101
Voted
ICCV
2005
IEEE
15 years 7 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
15 years 1 months ago
On Minimum-Area Hulls
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...