Sciweavers

4934 search results - page 153 / 987
» complexity 2008
Sort
View
JDA
2008
67views more  JDA 2008»
15 years 4 months ago
On minimum k-modal partitions of permutations
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result
Gabriele Di Stefano, Stefan Krause, Marco E. L&uum...
SPLC
2007
15 years 5 months ago
CIDE: Decomposing Legacy Applications into Features
Taking an extractive approach to decompose a legacy application into features is difficult and laborious with current approaches and tools. We present a prototype of a tooldriven...
Christian Kästner
TSP
2008
89views more  TSP 2008»
15 years 4 months ago
Coordinated Beamforming for the Multiuser MIMO Broadcast Channel With Limited Feedforward
Abstract-- Linear transmit beamforming and receive combining is a low complexity approach for communications in the multiuser multiple-input multiple-output (MIMO) channel. This pa...
Chan-Byoung Chae, David Mazzarese, Takao Inoue, Ro...
TSP
2008
76views more  TSP 2008»
15 years 4 months ago
Signaling With Imperfect Channel State Information: A Battery Power Efficiency Comparison
Abstract--Due to complexity considerations, pulse-based modulations such as pulse position modulation (PPM) and ON
Fengzhong Qu, Dongliang Duan, Liuqing Yang, Ananth...
SIGMOD
2008
ACM
101views Database» more  SIGMOD 2008»
16 years 4 months ago
On Query Algebras for Probabilistic Databases
This article proposes a core query algebra for probabilistic databases. In essence, this core is part of the query languages of most probabilistic database systems proposed so far...
Christoph Koch