3072 search results - page 134 / 615 » Shape analysis algorithm based on information theory |
COLT
1999
Springer
15 years 2 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
IR
2010
14 years 8 months ago
2010
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
IPPS
2006
IEEE
15 years 4 months ago
2006
IEEE
While monitoring, instrumented long running parallel applications generate huge amount of instrumentation data. Processing and storing this data incurs overhead, and perturbs the ...
JMLR
2010
14 years 4 months ago
2010
We present an extension of sparse PCA, or sparse dictionary learning, where the sparsity patterns of all dictionary elements are structured and constrained to belong to a prespeci...
VDA
2010
14 years 7 months ago
2010
The exploration of multidimensional scalar fields is commonly based on the knowledge of the topology of their isosurfaces. The latter is established through the analysis of critic...