Sciweavers

14165 search results - page 461 / 2833
» The generalized two-server problem
Sort
View
NIPS
2007
15 years 8 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
IEICET
2007
94views more  IEICET 2007»
15 years 6 months ago
A New Meta-Criterion for Regularized Subspace Information Criterion
In order to obtain better generalization performance in supervised learning, model parameters should be determined appropriately, i.e., they should be determined so that the gener...
Yasushi Hidaka, Masashi Sugiyama
WWW
2011
ACM
15 years 1 months ago
An expressive mechanism for auctions on the web
Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-ite...
Paul Dütting, Monika Henzinger, Ingmar Weber
CGF
2011
14 years 10 months ago
Intrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...
COMPGEOM
2011
ACM
14 years 10 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...