Sciweavers

831 search results - page 112 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 10 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
WWW
2005
ACM
14 years 11 months ago
Duplicate detection in click streams
We consider the problem of finding duplicates in data streams. Duplicate detection in data streams is utilized in various applications including fraud detection. We develop a solu...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
VLDB
2000
ACM
163views Database» more  VLDB 2000»
14 years 1 months ago
Hierarchical Compact Cube for Range-Max Queries
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...
Sin Yeung Lee, Tok Wang Ling, Hua-Gang Li
MICCAI
2004
Springer
14 years 11 months ago
Construction of 3D Dynamic Statistical Deformable Models for Complex Topological Shapes
Abstract. This paper describes the construction of 3D dynamic statistical deformable models for complex topological shapes. It significantly extents the existing framework in that ...
Paramate Horkaew, Guang-Zhong Yang
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
14 years 10 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...