Sciweavers

4117 search results - page 555 / 824
» On the Satisfiability of Complex Constraints
Sort
View
TCOM
2010
61views more  TCOM 2010»
15 years 5 months ago
Variable-rate M-PSK communications without channel amplitude estimation
—Channel estimation at the receiver side is essential to adaptive modulation schemes, prohibiting low complexity systems from using variable rate and/or variable power transmissi...
Athanasios S. Lioumpas, George K. Karagiannidis
EMNLP
2010
15 years 4 months ago
Simple Type-Level Unsupervised POS Tagging
Part-of-speech (POS) tag distributions are known to exhibit sparsity -- a word is likely to take a single predominant tag in a corpus. Recent research has demonstrated that incorp...
Yoong Keok Lee, Aria Haghighi, Regina Barzilay
AOSD
2011
ACM
15 years 1 months ago
Measuring the effects of aspect-oriented refactoring on component relationships: two case studies
Aspect-oriented refactoring is a promising technique for improving modularity and reducing complexity of existing software systems through encapsulating crosscutting concerns. As ...
Reishi Yokomori, Harvey P. Siy, Norihiro Yoshida, ...
IPPS
2009
IEEE
16 years 1 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
LICS
2002
IEEE
15 years 11 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin