Sciweavers

4850 search results - page 122 / 970
» Approximate Data Structures with Applications
Sort
View
WISE
2008
Springer
15 years 4 months ago
Approximate Information Filtering in Peer-to-Peer Networks
Abstract. Most approaches to information filtering taken so far have the underlying hypothesis of potentially delivering notifications from every information producer to subscrib...
Christian Zimmer, Christos Tryfonopoulos, Klaus Be...
IPSN
2007
Springer
15 years 4 months ago
Approximate isocontours and spatial summaries for sensor networks
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
Sorabh Gandhi, John Hershberger, Subhash Suri
PODS
2006
ACM
108views Database» more  PODS 2006»
15 years 10 months ago
Deterministic k-set structure
A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the s...
Sumit Ganguly, Anirban Majumder
RSCTC
2000
Springer
139views Fuzzy Logic» more  RSCTC 2000»
15 years 1 months ago
Application of Normalized Decision Measures to the New Case Classification
The optimization of rough set based classification models with respect to parameterized balance between a model's complexity and confidence is discussed. For this purpose, the...
Dominik Slezak, Jakub Wroblewski
ADCM
2006
74views more  ADCM 2006»
14 years 10 months ago
Linearly constrained reconstruction of functions by kernels with applications to machine learning
This paper investigates the approximation of multivariate functions from data via linear combinations of translates of a positive definite kernel from a reproducing kernel Hilbert...
Robert Schaback, J. Werner