4934 search results - page 153 / 987 » complexity 2008 |
111
click to vote
JDA
2008
15 years 4 months ago
2008
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result
123
click to vote
SPLC
2007
15 years 5 months ago
2007
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...
134
click to vote
TSP
2008
15 years 4 months ago
2008
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...
106
click to vote
TSP
2008
15 years 4 months ago
2008
Abstract--Due to complexity considerations, pulse-based modulations such as pulse position modulation (PPM) and ON
191
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
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...