Sciweavers

694 search results - page 18 / 139
» On the Dimensions of Data Complexity through Synthetic Data ...
Sort
View
ICDM
2002
IEEE
133views Data Mining» more  ICDM 2002»
14 years 1 months ago
Estimating the number of segments in time series data using permutation tests
Segmentation is a popular technique for discovering structure in time series data. We address the largely open problem of estimating the number of segments that can be reliably di...
Kari Vasko, Hannu Toivonen
CVPR
2010
IEEE
13 years 7 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
CGA
1999
13 years 8 months ago
Visualizing Large Telecommunication Data Sets
displays to abstract network data and let users interactwithit.Wehaveimplementedafull-scaleSwift3D prototype, which generated the examples we present here. Swift-3D We developed Sw...
Eleftherios Koutsofios, Stephen C. North, Daniel A...
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 9 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
ECCV
2008
Springer
14 years 10 months ago
Higher Dimensional Affine Registration and Vision Applications
Abstract. Affine registration has a long and venerable history in computer vision literature, and extensive work have been done for affine registrations in IR2 and IR3 . In this pa...
Yu-Tseh Chi, S. M. Nejhum Shahed, Jeffrey Ho, Ming...