Sciweavers

7796 search results - page 343 / 1560
» On Generalized Schur Numbers
Sort
View
201
Voted
CORR
2011
Springer
160views Education» more  CORR 2011»
15 years 1 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
DISOPT
2011
240views Education» more  DISOPT 2011»
15 years 1 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
TIT
2010
102views Education» more  TIT 2010»
15 years 1 months ago
On instantaneous relaying
Abstract--The Gaussian, three-node relay channel with orthogonal receive components (i.e., the transmitted signals from the source and the relay do not interfere with each other) i...
Majid Nasiri Khormuji, Mikael Skoglund
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
14 years 9 months ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
COMPSAC
2011
IEEE
14 years 6 months ago
L1 - An Intermediate Language for Mixed-Protocol Secure Computation
—Secure Computation (SC) enables secure distributed computation of arbitrary functions of private inputs. It has many useful applications, e.g. benchmarking or auctions. Several ...
Axel Schröpfer, Florian Kerschbaum, Guenter M...