Sciweavers

1094 search results - page 74 / 219
» One Size Fits All
Sort
View
CF
2008
ACM
14 years 2 days ago
A distributed evolutionary method to design scheduling policies for volunteer computing
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
Trilce Estrada, Olac Fuentes, Michela Taufer
BCBGC
2008
13 years 11 months ago
BMA - Boolean Matrices as Model for Motif Kernels
We introduce the data model BM, which specifies kernels of motifs by means of Boolean matrices. Different from position frequency matrices these only specify which bases can appea...
Jan Schröder, Manfred Schimmler, Heiko Schr&o...
ICDE
2007
IEEE
220views Database» more  ICDE 2007»
14 years 11 months ago
Structural Selectivity Estimation for XML Documents
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
Damien K. Fisher, Sebastian Maneth
COMBINATORICA
2010
13 years 7 months ago
Online vertex-coloring games in random graphs
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
Martin Marciniszyn, Reto Spöhel
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
14 years 10 months ago
Online Maintenance of Very Large Random Samples
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
Chris Jermaine, Abhijit Pol, Subramanian Arumugam