Sciweavers

1716 search results - page 205 / 344
» Proving Conditional Termination
Sort
View
106
Voted
DM
2008
77views more  DM 2008»
14 years 11 months ago
Perfect Skolem sets
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
Gustav Nordh
FOCM
2010
90views more  FOCM 2010»
14 years 11 months ago
Convergence of a Time Discretisation for Doubly Nonlinear Evolution Equations of Second Order
The convergence of a time discretisation with variable time steps is shown for a class of doubly nonlinear evolution equations of second order. This also proves existence of a weak...
Etienne Emmrich, Mechthild Thalhammer
CAI
2009
Springer
14 years 10 months ago
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes
This paper studies conditions under which the operation of parallel insertion can be reversed by parallel deletion, i.e., when does the equality (L1 L2) L2 = L1 hold for language...
Bo Cui, Lila Kari, Shinnosuke Seki
131
Voted
CPC
2010
117views more  CPC 2010»
14 years 10 months ago
On the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
129
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
A Greedy Link Scheduler for Wireless Networks with Gaussian Multiple Access and Broadcast Channels
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to trans...
Arun Sridharan, Can Emre Koksal, Elif Uysal-Biyiko...