Sciweavers

274 search results - page 18 / 55
» On Random Sampling over Joins
Sort
View
CCCG
2010
15 years 3 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
101
Voted
METRICS
2005
IEEE
15 years 7 months ago
An Empirical Analysis of Software Productivity over Time
OBJECTIVE - the aim is to investigate how software project productivity has changed over time. Within this overall goal we also compare productivity between different business sec...
Rahul Premraj, Martin J. Shepperd, Barbara A. Kitc...
127
Voted
SIGMOD
2004
ACM
153views Database» more  SIGMOD 2004»
15 years 7 months ago
Spatially-decaying aggregation over a network: model and algorithms
Data items are often associated with a location in which they are present or collected, and their relevance or in uence decays with their distance. Aggregate values over such data...
Edith Cohen, Haim Kaplan
SAT
2005
Springer
133views Hardware» more  SAT 2005»
15 years 7 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
STACS
2001
Springer
15 years 6 months ago
Randomness, Computability, and Density
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...