Sciweavers

631 search results - page 56 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
ICCBR
2003
Springer
14 years 3 months ago
An Empirical Analysis of Linear Adaptation Techniques for Case-Based Prediction
This paper is an empirical investigation into the effectiveness of linear scaling adaptation for case-based software project effort prediction. We compare two variants of a linea...
Colin Kirsopp, Emilia Mendes, Rahul Premraj, Marti...
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 5 months ago
Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks
—The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is...
Arash Khabbazibasmenj, Sergiy A. Vorobyov
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 10 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
EDBT
2009
ACM
133views Database» more  EDBT 2009»
14 years 5 months ago
Multiplicative synopses for relative-error metrics
Existing hierarchical summarization techniques fail to provide synopses good in terms of relative-error metrics. This paper introduces multiplicative synopses: a summarization par...
Panagiotis Karras
MFCS
2007
Springer
14 years 4 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov