Sciweavers

9842 search results - page 1850 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
WACV
2002
IEEE
14 years 3 months ago
Fingerprint Verification Using Genetic Algorithms
Fingerprint matching is still a challenging problem for reliable person authentication because of the complex distortions involved in two impressions of the same finger. In this p...
Xuejun Tan, Bir Bhanu
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
SPAA
2010
ACM
14 years 2 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
DESRIST
2010
Springer
171views Education» more  DESRIST 2010»
14 years 2 months ago
Usability through System-User Collaboration
Enterprise Resource Planning (ERP) systems have become essential in industry, yet the potential value created through system use can be illusive due to poor usability. Extensive in...
Tamara Babaian, Wendy T. Lucas, Jennifer Xu, Heikk...
ECOOP
2010
Springer
14 years 2 months ago
Essential AOP: The A Calculus
Abstract. Aspect-oriented programming (AOP) has produced interesting language designs, but also ad hoc semantics that needs clarification. We contribute to this clarification wit...
Bruno De Fraine, Erik Ernst, Mario Südholt
« Prev « First page 1850 / 1969 Last » Next »