Sciweavers

1523 search results - page 95 / 305
» Partially ordered secretaries
Sort
View
COMBINATORICS
2000
88views more  COMBINATORICS 2000»
15 years 16 days ago
An Infinite Antichain of Permutations
We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain. In other words, there exists an infini...
Daniel A. Spielman, Miklós Bóna
99
Voted
LCN
2005
IEEE
15 years 6 months ago
Approximate Coverage in Wireless Sensor Networks
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
Yuzhen Liu, Weifa Liang
BIOCOMP
2006
15 years 2 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 7 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
KBS
2011
81views more  KBS 2011»
14 years 7 months ago
Existential rigidity and many modalities in order-sorted logic
Order-sorted logic is a useful tool for knowledge representation and reasoning because it enables representation of sorted terms and formulas along with partially ordered sorts (c...
Ken Kaneiwa