Sciweavers

217 search results - page 27 / 44
» Parameterized algorithms for d-Hitting Set: The weighted cas...
Sort
View
EOR
2011
140views more  EOR 2011»
14 years 4 months ago
Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
Stefan Bolus
PDPTA
2000
14 years 11 months ago
Evaluation of Neural and Genetic Algorithms for Synthesizing Parallel Storage Schemes
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
Mayez A. Al-Mouhamed, Husam Abu-Haimed
MUE
2008
IEEE
173views Multimedia» more  MUE 2008»
15 years 4 months ago
Efficient Data Dissemination in Mobile P2P Ad-Hoc Networks for Ubiquitous Computing
In this paper we propose Rank-Based Broadcast (RBB) algorithm using High Order Markov Chain (HOMC) with weight values in mobile p2p ad-hoc networks (MOPNET) for ubiquitous. RBB us...
Do-Hoon Kim, Myoung Rak Lee, Longzhe Han, Hoh Pete...
FOCS
2009
IEEE
15 years 4 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
ECCV
2002
Springer
15 years 11 months ago
Multi-scale EM-ICP: A Fast and Robust Approach for Surface Registration
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
Sébastien Granger, Xavier Pennec