Sciweavers

677 search results - page 6 / 136
» Reducing the Space Requirement of LZ-Index
Sort
View
EUROPAR
2008
Springer
14 years 11 months ago
Reducing Kernel Development Complexity in Distributed Environments
Setting up generic and fully transparent distributed services for clusters implies complex and tedious kernel developments. More flexible approaches such as user-space libraries ar...
Adrien Lebre, Renaud Lottiaux, Erich Focht, Christ...
CIKM
1999
Springer
15 years 1 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
72
Voted
ICMCS
2009
IEEE
124views Multimedia» more  ICMCS 2009»
14 years 7 months ago
Adaptive division of feature space for rapid detection of near-duplicate video segments
Near-duplicate video detection is becoming a core-technology for analyzing the structure of a large-scale video archive. It, however, is naturally an O(n2 ) problem, where n is a ...
Ichiro Ide, Shugo Suzuki, Tomokazu Takahashi, Hiro...
VTC
2010
IEEE
122views Communications» more  VTC 2010»
14 years 7 months ago
Space-Time Codes with Block-Orthogonal Structure and Their Simplified ML and Near-ML Decoding
Existing high-rate full diversity space-time codes (STC) always have high decoding complexity with traditional ML (maximum-likelihood) or near-ML decoding. Hence the decoding schem...
Tian Peng Ren, Yong Liang Guan, Chau Yuen, Er Yang...
70
Voted
HPCC
2005
Springer
15 years 3 months ago
Reducing Memory Sharing Overheads in Distributed JVMs
Distributed JVM systems enable concurrent Java applications to transparently run on clusters of commodity computers by supporting Java’s shared-memory model over multiple JVMs di...
Marcelo Lobosco, Orlando Loques, Claudio Luis de A...