Sciweavers

1124 search results - page 63 / 225
» Constructing Common Information Spaces
Sort
View
82
Voted
AVI
2008
15 years 3 months ago
Starburst: a target expansion algorithm for non-uniform target distributions
Acquiring small targets on a tablet or touch screen can be challenging. To address the problem, researchers have proposed techniques that enlarge the effective size of targets by ...
Patrick Baudisch, Alexander Zotov, Edward Cutrell,...
ICC
2008
IEEE
120views Communications» more  ICC 2008»
15 years 7 months ago
Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
Abstract— Single-Symbol Maximum Likelihood (ML) decodable Distributed Orthogonal Space-Time Block Codes (DOSTBCs) have been introduced recently for cooperative networks and an up...
Jagadeesh Harshan, B. Sundar Rajan
DIGITALCITIES
2001
Springer
15 years 5 months ago
Connecting Digital and Physical Cities
As a platform for community networks, public information spaces that mirror the city metaphor are being developed around the world. The aim of digital cities is to pursue a future ...
Toru Ishida, Hiroshi Ishiguro, Hideyuki Nakanishi
111
Voted
DAWAK
1999
Springer
15 years 5 months ago
Efficient Bulk Loading of Large High-Dimensional Indexes
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Christian Böhm, Hans-Peter Kriegel
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
16 years 2 months ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa