Sciweavers

8768 search results - page 41 / 1754
» Generalizing the notion of support
Sort
View
FOCS
2006
IEEE
16 years 10 days ago
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
Luis Rademacher, Santosh Vempala
HT
2003
ACM
15 years 11 months ago
Browsing intricately interconnected paths
Graph-centric and node-centric browsing are the two commonly identified hypertext-browsing paradigms. We believe that pathcentric browsing, the browsing behavior exhibited by path...
Pratik Dave, Unmil Karadkar, Richard Furuta, Luis ...
DKE
2000
102views more  DKE 2000»
15 years 6 months ago
A Generic Framework for the Modeling of Contexts and its Applications
: Large information bases that are used by several different users and applications accommodate the demands of their users more effectively, if they can be split into possibly over...
Renate Motschnig-Pitrik
JMLR
2010
135views more  JMLR 2010»
15 years 4 months ago
Bundle Methods for Regularized Risk Minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
Choon Hui Teo, S. V. N. Vishwanathan, Alex J. Smol...
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
16 years 6 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...