Sciweavers

1538 search results - page 52 / 308
» Relative Randomness and Cardinality
Sort
View
DAC
1989
ACM
15 years 1 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong
CORR
2008
Springer
106views Education» more  CORR 2008»
14 years 9 months ago
Outer Bounds for Multiple Access Channels with Feedback using Dependence Balance
We use the idea of dependence balance to obtain a new outer bound for the capacity region of the discrete memoryless multiple-access channel with noiseless feedback (MAC-FB). We co...
Ravi Tandon, Sennur Ulukus
JCB
1998
105views more  JCB 1998»
14 years 9 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
ACL
2010
14 years 7 months ago
Practical Very Large Scale CRFs
Conditional Random Fields (CRFs) are a widely-used approach for supervised sequence labelling, notably due to their ability to handle large description spaces and to integrate str...
Thomas Lavergne, Olivier Cappé, Franç...
ESORICS
2009
Springer
15 years 10 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo