Sciweavers

917 search results - page 167 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 11 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
14 years 6 months ago
Exact Discovery of Time Series Motifs.
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
Abdullah Mueen, Eamonn J. Keogh, M. Brandon Westov...
ICSM
2005
IEEE
14 years 2 months ago
Co-Change Visualization
Clustering layouts of software systems combine two important aspects: they reveal groups of related artifacts of the software system, and they produce a visualization of the resul...
Dirk Beyer
CIDR
2003
164views Algorithms» more  CIDR 2003»
13 years 10 months ago
Capacity Bound-free Web Warehouse
Web cache technologies have been developed as an extension of CPU cache, by modifying LRU (Least Recently Used) algorithms. Actually in web cache systems, we can use disks and ter...
Yahiko Kambayashi, Kai Cheng
IJCV
2006
161views more  IJCV 2006»
13 years 9 months ago
Discriminative Random Fields
In this research we address the problem of classification and labeling of regions given a single static natural image. Natural images exhibit strong spatial dependencies, and mode...
Sanjiv Kumar, Martial Hebert