Sciweavers

846 search results - page 137 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
MP
2007
100views more  MP 2007»
13 years 8 months ago
Power optimization for connectivity problems
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. ...
PODS
2008
ACM
178views Database» more  PODS 2008»
14 years 9 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
PODS
2005
ACM
151views Database» more  PODS 2005»
14 years 9 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
BMCBI
2005
131views more  BMCBI 2005»
13 years 8 months ago
Functional annotation by identification of local surface similarities: a novel tool for structural genomics
Background: Protein function is often dependent on subsets of solvent-exposed residues that may exist in a similar three-dimensional configuration in non homologous proteins thus ...
Fabrizio Ferrè, Gabriele Ausiello, Andreas ...
RTCSA
2000
IEEE
14 years 1 months ago
Task attribute assignment of fixed priority scheduled tasks to reenact off-line schedules
A number of industrial applications advocate the use of time-triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-...
Radu Dobrin, Yusuf Özdemir, Gerhard Fohler