Sciweavers

5169 search results - page 234 / 1034
» Locality approximation using time
Sort
View
INFOCOM
2010
IEEE
15 years 5 months ago
Tracking Quantiles of Network Data Streams with Dynamic Operations
— Quantiles are very useful in characterizing the data distribution of an evolving dataset in the process of data mining or network monitoring. The method of Stochastic Approxima...
Jin Cao, Li (Erran) Li, Aiyou Chen, Tian Bu
SIAMMAX
2011
79views more  SIAMMAX 2011»
14 years 9 months ago
Nonlinear Low Rank Modification of a Symmetric Eigenvalue Problem
This paper studies existence and uniqueness results and interlacing properties of nonlinear modifications of small rank of symmetric eigenvalue problems. Approximation properties ...
Heinrich Voss, Kemal Yildiztekin, Xin Huang
GECCO
2000
Springer
122views Optimization» more  GECCO 2000»
15 years 10 months ago
Genetic Programming with Statically Scoped Local Variables
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
Evan Kirshenbaum
DCC
2002
IEEE
16 years 6 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
APLAS
2007
ACM
15 years 10 months ago
Timed, Distributed, Probabilistic, Typed Processes
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
Martin Berger, Nobuko Yoshida