Sciweavers

19320 search results - page 3750 / 3864
» On the complexity of computing determinants
Sort
View
BTW
2009
Springer
138views Database» more  BTW 2009»
15 years 4 months ago
GEM: A Generic Visualization and Editing Facility for Heterogeneous Metadata
: Many model management tasks, e.g., schema matching or merging, require the manual handling of metadata. Given the diversity of metadata, its many different representations and mo...
Jürgen Göres, Thomas Jörg, Boris St...
CIKM
2009
Springer
15 years 4 months ago
A social recommendation framework based on multi-scale continuous conditional random fields
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
Xin Xin, Irwin King, Hongbo Deng, Michael R. Lyu
CPAIOR
2009
Springer
15 years 4 months ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 4 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
FSTTCS
2009
Springer
15 years 4 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
« Prev « First page 3750 / 3864 Last » Next »