Sciweavers

4560 search results - page 694 / 912
» Finding Data in the Neighborhood
Sort
View
ICFP
2002
ACM
16 years 6 months ago
Monads for incremental computing
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
Magnus Carlsson
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
16 years 6 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
PERCOM
2003
ACM
16 years 6 months ago
Self-Adaptive Leasing for Jini
Distributed systems require strategies to detect and recover from failures. Many protocols for distributed systems employ a strategy based on leases, which grant a leaseholder acc...
Kevin Bowers, Kevin Mills, Scott Rose
DCC
2006
IEEE
16 years 6 months ago
Non-Asymptotic Design of Finite State Universal Predictors for Individual Sequences
In this work we consider the problem of universal prediction of individual sequences where the universal predictor is a deterministic finite state machine, with a fixed, relativel...
Amir Ingber, Meir Feder
DCC
2006
IEEE
16 years 6 months ago
Compression and Machine Learning: A New Perspective on Feature Space Vectors
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
D. Sculley, Carla E. Brodley