Sciweavers

153 search results - page 14 / 31
» Near-linear approximation algorithms for geometric hitting s...
Sort
View
ICDE
1999
IEEE
148views Database» more  ICDE 1999»
16 years 6 months ago
Efficient Mining of Partial Periodic Patterns in Time Series Database
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
Jiawei Han, Guozhu Dong, Yiwen Yin
PREMI
2005
Springer
15 years 10 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...
SENSYS
2006
ACM
15 years 11 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
ICIP
1999
IEEE
15 years 9 months ago
Compensation of Unidirectional Geometric Distortion in EPI Using Spline Warping
Due to magnetic field inhomogeneities, EPI images are geometrically distorted, predominantly along the phase-encoding direction. Currently, the distortion is either ignored or com...
Jan Kybic, Philippe Thévenaz, Michael Unser
COCOA
2008
Springer
15 years 7 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth