Sciweavers

2233 search results - page 185 / 447
» On the Complexity of Theory Curbing
Sort
View
SIAMCOMP
2012
13 years 9 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
ICML
2009
IEEE
16 years 7 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
EDBTW
2010
Springer
16 years 1 months ago
Updating probabilistic XML
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
Evgeny Kharlamov, Werner Nutt, Pierre Senellart
ATAL
2007
Springer
16 years 20 days ago
F-trade: an agent-mining symbiont for financial services
The interaction and integration of agent technology and data mining presents prominent benefits to solve some of challenging issues in individual areas. For instance, data mining ...
Longbing Cao, Chengqi Zhang
GECCO
2005
Springer
220views Optimization» more  GECCO 2005»
16 years 9 hour ago
Scale invariant pareto optimality: a meta--formalism for characterizing and modeling cooperativity in evolutionary systems
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
Mark Fleischer