Sciweavers

2498 search results - page 190 / 500
» Data Structures with Unpredictable Timing
Sort
View
WWW
2008
ACM
15 years 11 months ago
Computable social patterns from sparse sensor data
We present a computational framework to automatically discover high-order temporal social patterns from very noisy and sparse location data. We introduce the concept of social foo...
Dinh Q. Phung, Brett Adams, Svetha Venkatesh
92
Voted
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
15 years 10 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
90
Voted
MICCAI
2009
Springer
15 years 7 months ago
Constrained Data Decomposition and Regression for Analyzing Healthy Aging from Fiber Tract Diffusion Properties
Abstract. It has been shown that brain structures in normal aging undergo significant changes attributed to neurodevelopmental and neurodegeneration processes as a lifelong, dynami...
Sylvain Gouttard, Marcel Prastawa, Elizabeth Bulli...
ICDT
2001
ACM
116views Database» more  ICDT 2001»
15 years 2 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
SSD
2001
Springer
162views Database» more  SSD 2001»
15 years 2 months ago
Interval Sequences: An Object-Relational Approach to Manage Spatial Data
The design of external index structures for one- and multidimensional extended objects is a long and well studied subject in basic database research. Today, more and more commercia...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl