Sciweavers

921 search results - page 17 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
143
Voted
PERCOM
2007
ACM
16 years 3 months ago
Structural Learning of Activities from Sparse Datasets
Abstract. A major challenge in pervasive computing is to learn activity patterns, such as bathing and cleaning from sensor data. Typical sensor deployments generate sparse datasets...
Fahd Albinali, Nigel Davies, Adrian Friday
114
Voted
ICC
2007
IEEE
110views Communications» more  ICC 2007»
15 years 10 months ago
A New STC Structure to Achieve Generalized Optimal Diversity with a Reduced Design Complexity
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
Moon Il Lee, Seong Keun Oh, Dong Seung Kwon
137
Voted
SPAA
1990
ACM
15 years 7 months ago
Optimal Cooperative Search in Fractional Cascaded Data Structures
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Roberto Tamassia, Jeffrey Scott Vitter
219
Voted
ICDE
2004
IEEE
125views Database» more  ICDE 2004»
16 years 5 months ago
Range CUBE: Efficient Cube Computation by Exploiting Data Correlation
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
Ying Feng, Divyakant Agrawal, Amr El Abbadi, Ahmed...
103
Voted
LREC
2010
184views Education» more  LREC 2010»
15 years 5 months ago
New Features in Spoken Language Search Hawk (SpLaSH): Query Language and Query Sequence
In this work we present further development of the SpLaSH (Spoken Language Search Hawk) project. SpLaSH implements a data model for annotated speech corpora integrated with textua...
Sara Romano, Francesco Cutugno