9888 search results - page 1783 / 1978 » compute 2009 |
196
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
194
click to vote
APNOMS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we focus on the scheme for the route optimization in 6LoWPAN based MANEMO environments. If 6LoWPAN mobile routers for supporting NEMO protocol are organized by neste...
184
click to vote
BICOB
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. With the availability of hundreds and soon-to-be thousands of complete genomes, the construction of genome-scale metabolic models for these organisms has attracted much a...
171
click to vote
BICOB
2009
Springer
16 years 1 months ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
164
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...