Sciweavers

237 search results - page 19 / 48
» Methods for Achieving Fast Query Times in Point Location Dat...
Sort
View
KDD
2004
ACM
168views Data Mining» more  KDD 2004»
14 years 8 months ago
Mining, indexing, and querying historical spatiotemporal data
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
Nikos Mamoulis, Huiping Cao, George Kollios, Mario...
DICTA
2003
13 years 9 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
SDM
2010
SIAM
192views Data Mining» more  SDM 2010»
13 years 9 months ago
Fast and Accurate Gene Prediction by Decision Tree Classification
Gene prediction is one of the most challenging tasks in genome analysis, for which many tools have been developed and are still evolving. In this paper, we present a novel gene pr...
Rong She, Jeffrey Shih-Chieh Chu, Ke Wang, Nanshen...
IEEECIT
2006
IEEE
14 years 1 months ago
One Update for all Moving Objects at a Timestamp
Concurrently with fast development of location aware technologies, many applications have been developing to exploit location data for serving people. However, a main challenge in...
Hoang Do Thanh Tung, Keun Ho Ryu
ICPR
2006
IEEE
14 years 9 months ago
Graph Matching using Commute Time Spanning Trees
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Edwin R. Hancock, Huaijun Qiu