3229 search results - page 306 / 646 » The Theory of Timed Automata |
168
click to vote
ECCC
2007
15 years 6 months ago
2007
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
329
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
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...
170
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
We provide a time domain analysis of the robustness and stability performance for coupled adaptive algorithms of gradient type. The considered coupling may occur inherently as wel...
167
click to vote
SIGMETRICS
2006
ACM
16 years 23 days ago
2006
ACM
The Erlang formula is known to be insensitive to the holding time distribution beyond the mean. While calls are generally assumed to arrive as a Poisson process, we prove that it ...
179
click to vote
SAINT
2005
IEEE
16 years 11 days ago
2005
IEEE
Basket Analysis is mathematically characterized and extended to search families of sets in this paper. These theories indicate the possibility of various new approaches of data mi...