Sciweavers

1487 search results - page 110 / 298
» The Computational Complexity of Link Building
Sort
View
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 4 months ago
On the decomposition of k-valued rational relations
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by...
Jacques Sakarovitch, Rodrigo de Souza
SPEECH
2002
91views more  SPEECH 2002»
15 years 3 months ago
Large vocabulary continuous speech recognition of Broadcast News - The Philips/RWTH approach
Automatic speech recognition of real-live broadcast news (BN) data (Hub-4) has become a challenging research topic in recent years. This paper summarizes our key efforts to build ...
Peter Beyerlein, Xavier L. Aubert, Reinhold Haeb-U...
ICCS
2004
Springer
15 years 9 months ago
Point-Based Modeling from a Single Image
Abstract. The complexity of virtual environments has grown spectacularly over the recent years, mainly thanks to the use of the currently cheap high performance graphics cards. As ...
Pere-Pau Vázquez, Jordi Marco, Mateu Sbert
LCTRTS
2010
Springer
15 years 2 months ago
Compiler directed network-on-chip reliability enhancement for chip multiprocessors
Chip multiprocessors (CMPs) are expected to be the building blocks for future computer systems. While architecting these emerging CMPs is a challenging problem on its own, program...
Ozcan Ozturk, Mahmut T. Kandemir, Mary Jane Irwin,...
BMCBI
2010
108views more  BMCBI 2010»
15 years 1 months ago
BIGSdb: Scalable analysis of bacterial genome variation at the population level
Background: The opportunities for bacterial population genomics that are being realised by the application of parallel nucleotide sequencing require novel bioinformatics platforms...
Keith A. Jolley, Martin C. J. Maiden