Sciweavers

1688 search results - page 58 / 338
» The Complexity of Rationalizing Matchings
Sort
View
COCOON
2008
Springer
13 years 12 months ago
On the Complexity of Equilibria Problems in Angel-Daemon Games
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
Joaquim Gabarró, Alina García, Maria...
COLING
2008
13 years 11 months ago
Modeling the Structure and Dynamics of the Consonant Inventories: A Complex Network Approach
We study the self-organization of the consonant inventories through a complex network approach. We observe that the distribution of occurrence as well as cooccurrence of the conso...
Animesh Mukherjee, Monojit Choudhury, Anupam Basu,...
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
14 years 4 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
ICIP
1998
IEEE
14 years 2 months ago
Image Warping using Adaptive Partial Matching
The block-matching motion estimation algorithm using a translational motion model cannot provide acceptable image quality in low bit-rate coding. To improve coding performance, we ...
Dong-Keun Lim, Yo-Sung Ho
ICDAR
2009
IEEE
14 years 4 months ago
Detecting Printed and Handwritten Partial Copies of Line Drawings Embedded in Complex Backgrounds
The partial copy is a kind of copy produced by cropping parts of original materials. Illegal users often use this technique for plagiarizing copyrighted materials. In addition, or...
Weihan Sun, Koichi Kise