Sciweavers

4451 search results - page 333 / 891
» On Random Ordering Constraints
Sort
View
EJC
2007
15 years 6 months ago
Online balanced graph avoidance games
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
PVLDB
2008
127views more  PVLDB 2008»
15 years 6 months ago
Hashed samples: selectivity estimators for set similarity selection queries
We study selectivity estimation techniques for set similarity queries. A wide variety of similarity measures for sets have been proposed in the past. In this work we concentrate o...
Marios Hadjieleftheriou, Xiaohui Yu, Nick Koudas, ...
SAC
2008
ACM
15 years 6 months ago
Error estimation in wireless sensor networks
We present an analogy between the operation of a Wireless Sensor Network and the sampling and reconstruction of a signal. We measure the impact of three factors on the quality of ...
Alejandro César Frery, Heitor Ramos, Jos&ea...
MA
2011
Springer
246views Communications» more  MA 2011»
15 years 1 months ago
On the Gaussian approximation of vector-valued multiple integrals
: By combining the findings of two recent, seminal papers by Nualart, Peccati and Tudor, we get that the convergence in law of any sequence of vector-valued multiple integrals Fn ...
Salim Noreddine, Ivan Nourdin
JCST
2010
189views more  JCST 2010»
15 years 1 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar