Sciweavers

7820 search results - page 1554 / 1564
» Formalization of Time and Space
Sort
View
TKDE
1998
122views more  TKDE 1998»
13 years 7 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
TCSV
2002
90views more  TCSV 2002»
13 years 7 months ago
Shot-boundary detection: unraveled and resolved?
Partitioning a video sequence into shots is the first step toward video-content analysis and content-based video browsing and retrieval. A video shot is defined as a series of inte...
Alan Hanjalic
TJS
2002
160views more  TJS 2002»
13 years 7 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
CORR
2010
Springer
62views Education» more  CORR 2010»
13 years 7 months ago
Asymptotically-Good, Multigroup ML-Decodable STBCs
For a family/sequence of Space-Time Block Codes (STBCs) C1, C2, . . . , with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use, i = 1, 2, . ....
Natarajan Lakshmi Prasad, B. Sundar Rajan
PVLDB
2008
154views more  PVLDB 2008»
13 years 6 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing
« Prev « First page 1554 / 1564 Last » Next »