Sciweavers

1688 search results - page 21 / 338
» The Complexity of Rationalizing Matchings
Sort
View
AAAI
2007
13 years 10 months ago
Computational Complexity of Weighted Threshold Games
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its w...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
13 years 11 months ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres
CCCG
2008
13 years 9 months ago
On the Complexity of Point Recolouring in Geometric Graphs
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
Henk Meijer, Yurai Núñez Rodrí...
IEEEARES
2008
IEEE
14 years 2 months ago
Matching Policies with Security Claims of Mobile Applications
The Security-by-Contract (S×C) framework has been recently proposed to address the trust relationship problem of the current security model adopted for mobile devices. The key id...
Nataliia Bielova, Marco Dalla Torre, Nicola Dragon...
ICMLC
2010
Springer
13 years 5 months ago
Dangerous driving event prediction on expressways using fuzzy attributed map matching
: This paper presents a system for predicting dangerous driving events while driving on an expressway. There are three major tasks involved in the prediction system: (1) how to per...
Chiung-Yao Fang, Bo-Yan Wu, Jung Ming Wang, Sei-Wa...