Sciweavers

1143 search results - page 153 / 229
» pairing 2007
Sort
View
DC
2008
13 years 7 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 7 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
Nodally 3-connected planar graphs and convex combination mappings
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
Colm Ó'Dúnlaing
ENGL
2007
80views more  ENGL 2007»
13 years 7 months ago
Movement Compatibility for Rotary Control and Digital Display
— Using real mechanical controls, this experiment studied strength and reversibility of direction-of-motion stereotypes and response times for different configurations of digital...
W. H. Chan, Alan H. S. Chan
IJAR
2007
100views more  IJAR 2007»
13 years 7 months ago
Multisensor triplet Markov chains and theory of evidence
Hidden Markov chains (HMC) are widely applied in various problems occurring in different areas like Biosciences, Climatology, Communications, Ecology, Econometrics and Finances, ...
Wojciech Pieczynski