Sciweavers

1213 search results - page 5 / 243
» Approximation in quantale-enriched categories
Sort
View
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 9 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
ISSAC
2004
Springer
118views Mathematics» more  ISSAC 2004»
14 years 2 days ago
The approximate GCD of inexact polynomials
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. ...
Zhonggang Zeng, Barry H. Dayton
SIGCOMM
2010
ACM
13 years 6 months ago
Stochastic approximation algorithm for optimal throughput performance of wireless LANs
In this paper, we consider the problem of throughput maximization in an infrastructure based WLAN. We demonstrate that most of the proposed protocols though perform optimally for ...
Sundaresan Krishnan, Prasanna Chaporkar
EDBT
2010
ACM
110views Database» more  EDBT 2010»
14 years 1 months ago
The hardness and approximation algorithms for l-diversity
The existing solutions to privacy preserving publication can be classified into the theoretical and heuristic categories. The former guarantees provably low information loss, whe...
Xiaokui Xiao, Ke Yi, Yufei Tao
GECCO
2005
Springer
117views Optimization» more  GECCO 2005»
14 years 6 days ago
Extending XCSF beyond linear approximation
XCSF is the extension of XCS in which classifier prediction is computed as a linear combination of classifier inputs and a weight vector associated to each classifier. XCSF can...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...