Sciweavers

4218 search results - page 86 / 844
» Complete sets of cooperations
Sort
View
WIOPT
2010
IEEE
13 years 6 months ago
Routing games : From egoism to altruism
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and tha...
Amar Prakash Azad, Eitan Altman, Rachid El Azouzi
EMNLP
2009
13 years 6 months ago
Character-level Analysis of Semi-Structured Documents for Set Expansion
Set expansion refers to expanding a partial set of "seed" objects into a more complete set. One system that does set expansion is SEAL (Set Expander for Any Language), w...
Richard C. Wang, William W. Cohen
ICIAP
2007
ACM
14 years 3 months ago
Score-level fusion of fingerprint and face matchers for personal verification under "stress" conditions
Fusion of multiple face and fingerprint matchers based on different biometrics for personal authentication has been investigated in the last years. However, the performance achiev...
Gian Luca Marcialis, Fabio Roli
CSCWD
2009
Springer
14 years 1 months ago
Designing and evaluating interfaces for mobile groupware systems
Mobile cooperative systems can facilitate cooperation by improving the flexibility of usage. However, mobile devices present some constraints that become the design and implement...
Carla Diacui Medeiros Berkenbrock, Alexandre Parra...
COCO
1989
Springer
97views Algorithms» more  COCO 1989»
14 years 1 months ago
On the Structure of Bounded Queries to Arbitrary NP Sets
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
Richard Chang