Sciweavers

458 search results - page 54 / 92
» Perfect Skolem sets
Sort
View
DM
2010
102views more  DM 2010»
14 years 12 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu
IR
2008
14 years 11 months ago
Output-sensitive autocompletion search
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
Holger Bast, Christian Worm Mortensen, Ingmar Webe...
ENDM
2007
78views more  ENDM 2007»
14 years 11 months ago
The Interval Liar Game
We regard the problem of communication in the presence of faulty transmissions. In contrast to the classical works in this area, we assume some structure on the times when the faul...
Benjamin Doerr, Johannes Lengler, David Steurer
TSP
2008
166views more  TSP 2008»
14 years 11 months ago
A Convex Analysis Framework for Blind Separation of Non-Negative Sources
This paper presents a new framework for blind source separation (BSS) of non-negative source signals. The proposed framework, referred herein to as convex analysis of mixtures of ...
Tsung-Han Chan, Wing-Kin Ma, Chong-Yung Chi, Yue W...
CORR
2002
Springer
108views Education» more  CORR 2002»
14 years 11 months ago
Vote Elicitation: Complexity and Strategy-Proofness
Preference elicitation is a central problem in AI, and has received significant attention in single-agent settings. It is also a key problem in multiagent systems, but has receive...
Vincent Conitzer, Tuomas Sandholm