Sciweavers

4302 search results - page 291 / 861
» Index Pairs Algorithms
Sort
View
CORR
2007
Springer
111views Education» more  CORR 2007»
15 years 4 months ago
Link Scheduling in STDMA Wireless Networks: A Line Graph Approach
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...
N. Praneeth Kumar, Ashutosh Deepak Gore, Abhay Kar...
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
15 years 4 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
Jochen Könemann, Stefano Leonardi, Guido Sch&...
IPMU
2010
Springer
15 years 2 months ago
Rank Correlation Coefficient Correction by Removing Worst Cases
Abstract. Rank correlation can be used to compare two linearly ordered rankings. If the rankings include noise values, the rank correlation coefficient will yield lower values than...
Martin Krone, Frank Klawonn
RECOMB
2004
Springer
16 years 4 months ago
The Distribution of Inversion Lengths in Bacteria
The distribution of the lengths of genomic segments inverte during the evolutionary divergence of two species cannot be inferred d rectly from the output of genome rearrangement al...
Adrian Maler, David Sankoff, Elisabeth R. M. Tilli...
IPPS
1998
IEEE
15 years 8 months ago
Solving the Maximum Clique Problem Using PUBB
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
Yuji Shinano, Tetsuya Fujie, Yoshiko Ikebe, Ryuich...