Sciweavers

757 search results - page 40 / 152
» How to decide
Sort
View
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
13 years 8 months ago
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...
Emmanouil Pountourakis, Angelina Vidali
FCT
2005
Springer
14 years 1 months ago
Exact Algorithms for Graph Homomorphisms
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
FOSSACS
2001
Springer
14 years 6 days ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin
PSYCHNOLOGY
2007
75views more  PSYCHNOLOGY 2007»
13 years 7 months ago
Is It Fun to Go to Sydney? Common-Sense Knowledge of Social Structures and WAP
This paper investigated how people navigate through early Wireless Application Protocol (WAP) sites using their common-sense knowledge of social structures. The study is based on ...
Ilpo Koskinen
VLDB
2007
ACM
139views Database» more  VLDB 2007»
14 years 8 months ago
FuSem - Exploring Different Semantics of Data Fusion
Data fusion is the final step of a typical data integration process, after schematic conflicts have been overcome and after duplicates have been correctly identified. We present t...
Jens Bleiholder, Karsten Draba, Felix Naumann