Sciweavers

16843 search results - page 99 / 3369
» On Generalized Authorization Problems
Sort
View
COMBINATORICS
2007
86views more  COMBINATORICS 2007»
13 years 8 months ago
Lower Bounds for the Football Pool Problem for 7 and 8 Matches
Let k3(n) denote the minimal cardinality of a ternary code of length n and covering radius one. In this paper we show k3(7) ≥ 156 and k3(8) ≥ 402 improving on the best previou...
Wolfgang Haas
CHI
2010
ACM
14 years 3 months ago
On reconstruction of task context after interruption
Theoretical accounts of task resumption after interruption have almost exclusively argued for resumption as a primarily memory-based process. In contrast, for many task domains, r...
Dario D. Salvucci
COCOON
2009
Springer
14 years 2 months ago
On the Generalised Character Compatibility Problem for Non-branching Character Trees
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
Ján Manuch, Murray Patterson, Arvind Gupta
STOC
2007
ACM
164views Algorithms» more  STOC 2007»
14 years 8 months ago
All-pairs bottleneck paths for general graphs in truly sub-cubic time
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
Virginia Vassilevska, Ryan Williams, Raphael Yuste...
EOR
2010
82views more  EOR 2010»
13 years 8 months ago
Satisfactory graph partition, variants, and generalizations
The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbor...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten