Sciweavers

29 search results - page 4 / 6
» Note on alternating directed cycles
Sort
View
WIOPT
2010
IEEE
13 years 5 months ago
On capacity achieving property of rotational coding for acyclic deterministic wireless networks
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
Mohammad A. (Amir) Khojastepour, Alireza Keshavarz...
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
13 years 11 months ago
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Ming-Yang Kao, Manan Sanghi
COCOON
2005
Springer
14 years 27 days ago
Genome Rearrangements with Partially Ordered Chromosomes
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...
Chunfang Zheng, David Sankoff
MADNES
2005
Springer
14 years 25 days ago
Panel: Authentication in Constrained Environments
Abstract. This paper contains the summary of a panel on authentication in constrained environments held during the Secure MADNES’05 Workshop. These were transcribed from hand-wri...
Mike Burmester, Virgil D. Gligor, Evangelos Kranak...
ICML
2005
IEEE
14 years 8 months ago
Reducing overfitting in process model induction
In this paper, we review the paradigm of inductive process modeling, which uses background knowledge about possible component processes to construct quantitative models of dynamic...
Will Bridewell, Narges Bani Asadi, Pat Langley, Lj...