Sciweavers

747 search results - page 108 / 150
» Theory and Construction of Molecular Computers
Sort
View
PODC
2009
ACM
16 years 6 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
CHI
2008
ACM
16 years 6 months ago
Interactional empowerment
We propose that an interactional perspective on how emotion is constructed, shared and experienced, may be a good basis for designing affective interactional systems that do not i...
Anna Ståhl, Jarmo Laaksolahti, Kristina H&ou...
DCC
2006
IEEE
16 years 5 months ago
Optimal Index Assignment for Multiple Description Lattice Vector Quantization
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
Xiang Huang, Xiaolin Wu
ICDS
2009
IEEE
16 years 28 days ago
An Iterative Method to Design Traffic Flow Models
Existing traffic flow modeling theory lacks of guidelines to construct traffic flow models from scratch. In addition, traffic flow models are mainly analyzed with computer simulat...
Juan Manuel González-Calleros, Jorge Mart&i...
STACS
2007
Springer
16 years 7 days ago
The Polynomially Bounded Perfect Matching Problem Is in NC 2
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierau...