Sciweavers

3608 search results - page 611 / 722
» computing 2011
Sort
View
AI
2011
Springer
14 years 10 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
IDA
2011
Springer
14 years 10 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
SPEECH
2011
14 years 10 months ago
The importance of phase in speech enhancement
Typical speech enhancement methods, based on the short-time Fourier analysis-modification-synthesis (AMS) framework, modify only the magnitude spectrum and keep the phase spectru...
Kuldip K. Paliwal, Kamil K. Wójcicki, Benja...
INFOCOM
2011
IEEE
14 years 7 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
161
Voted
BMCBI
2011
14 years 6 months ago
Proteinortho: Detection of (Co-)Orthologs in Large-Scale Analysis
Background: Orthology analysis is an important part of data analysis in many areas of bioinformatics such as comparative genomics and molecular phylogenetics. The ever-increasing ...
Marcus Lechner, Sven Findeiß, Lydia Steiner,...