Sciweavers

5128 search results - page 379 / 1026
» Discrete Component Analysis
Sort
View
FQAS
2004
Springer
146views Database» more  FQAS 2004»
15 years 11 months ago
Discovering Representative Models in Large Time Series Databases
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
Simona E. Rombo, Giorgio Terracina
IDEAL
2000
Springer
15 years 11 months ago
Quantization of Continuous Input Variables for Binary Classification
Quantization of continuous variables is important in data analysis, especially for some model classes such as Bayesian networks and decision trees, which use discrete variables. Of...
Michal Skubacz, Jaakko Hollmén
COMPGEOM
1995
ACM
15 years 11 months ago
A Comparison of Sequential Delaunay Triangulation Algorithms
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
Peter Su, Robert L. (Scot) Drysdale III
COMPGEOM
1995
ACM
15 years 11 months ago
Searching for the Kernel of a Polygon - A Competitive Strategy
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
Christian Icking, Rolf Klein
190
Voted
ALGOSENSORS
2008
Springer
15 years 9 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri