Sciweavers

8695 search results - page 264 / 1739
» Making the Complex Simple
Sort
View
POPL
2008
ACM
16 years 7 months ago
Subcubic algorithms for recursive state machines
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...
Swarat Chaudhuri
ICC
2009
IEEE
16 years 1 months ago
Non-Coherent Receiver with Fractional Sampling for Impulsive UWB Systems
— We propose a low complexity noncoherent receiver operating at twice the symbol-rate for systems where each data symbol consists of multiple frames/chips. The receiver does not ...
Jian Zhang, Leif Hanlen
COLING
2008
15 years 8 months ago
Scaling up Analogical Learning
Recent years have witnessed a growing interest in analogical learning for NLP applications. If the principle of analogical learning is quite simple, it does involve complex steps ...
Philippe Langlais, François Yvon
ICMCS
2006
IEEE
101views Multimedia» more  ICMCS 2006»
16 years 21 days ago
Video Transcoding for Packet Loss Resilience Based on the Multiple Descriptions
This paper proposes error resilient video transcoding structures based on the multiple description (MD) scheme. Two structures are proposed for different use, namely low complexit...
Il Kim, Nam Cho
LAWEB
2007
IEEE
16 years 28 days ago
Designing the Interface of Rich Internet Applications
In this paper we present a novel approach for designing the interface of rich internet applications. Our approach uses ract Data Views (ADV) design model allowing expressing in a ...
Matias Urbieta, Gustavo Rossi, Jeronimo Ginzburg, ...