Sciweavers

4797 search results - page 278 / 960
» The complexity of partition tasks
Sort
View
GLOBECOM
2007
IEEE
16 years 28 days ago
Four Group Decodable Differential Scaled Unitary Linear Space-Time Codes
— Differential Unitary Space-Time Block codes (STBCs) offer a means to communicate on the Multiple Input Multiple Output (MIMO) channel without the need for channel knowledge at ...
G. Susinder Rajan, B. Sundar Rajan
GRID
2007
Springer
16 years 23 days ago
Log summarization and anomaly detection for troubleshooting distributed systems
— Today’s system monitoring tools are capable of detecting system failures such as host failures, OS errors, and network partitions in near-real time. Unfortunately, the same c...
Dan Gunter, Brian Tierney, Aaron Brown, D. Martin ...
IDA
2007
Springer
16 years 23 days ago
Compact and Understandable Descriptions of Mixtures of Bernoulli Distributions
Abstract. Finite mixture models can be used in estimating complex, unknown probability distributions and also in clustering data. The parameters of the models form a complex repres...
Jaakko Hollmén, Jarkko Tikka
ICMCS
2006
IEEE
157views Multimedia» more  ICMCS 2006»
16 years 19 days ago
RD-Optimization for MPEG-2 to H.264 Transcoding
1 In this paper, we introduce and evaluate a low complexity macroblock partition mode decision algorithm for interframe prediction in MPEG-2 to H.264 transcoder. The proposed tools...
Gerardo Fernández-Escribano, Hari Kalva, Pe...
MFCS
2005
Springer
16 years 3 days ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher