Sciweavers

327 search results - page 56 / 66
» Algorithms for infinite huffman-codes
Sort
View
JCT
2008
84views more  JCT 2008»
13 years 6 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas
SIAMJO
2008
99views more  SIAMJO 2008»
13 years 6 months ago
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
Marco C. Campi, Simone Garatti
TCOM
2008
98views more  TCOM 2008»
13 years 6 months ago
Performance evaluation of multi-hop CSMA/CA networks in fading environments
The performance of multi-hop CSMA/CA networks has in most cases been evaluated via simulations, or analytically using a perfect collision channel model. Using such methods, one ca...
Duong A. Hoang, Ronald A. Iltis
TROB
2008
86views more  TROB 2008»
13 years 6 months ago
Fusing Monocular Information in Multicamera SLAM
Abstract--This paper explores the possibilities of using monocular simultaneous localization and mapping (SLAM) algorithms in systems with more than one camera. The idea is to comb...
Joan Solà, André Monin, Michel Devy,...
AICOM
2002
103views more  AICOM 2002»
13 years 6 months ago
The emergent computational potential of evolving artificial living systems
The computational potential of artificial living systems can be studied without knowing the algorithms that govern their behavior. Modeling single organisms by means of socalled c...
Jirí Wiedermann, Jan van Leeuwen