820 search results - page 128 / 164 » Finding low-utility data structures |
261
click to vote
VLDB
2008
ACM
16 years 5 months ago
2008
ACM
This paper presents a probabilistic relational modelling (implementation) of the major probabilistic retrieval models. Such a high-level implementation is useful since it supports ...
161
click to vote
ICDE
2010
IEEE
16 years 5 months ago
2010
IEEE
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 ...
148
click to vote
DCC
2006
IEEE
16 years 5 months ago
2006
IEEE
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...
268
click to vote
VL
2008
IEEE
15 years 12 months ago
2008
IEEE
An important part of many programming tasks is the use of libraries and other forms of Application Programming Interfaces (APIs). Programming via web services using a Service-Orie...
142
click to vote
CCGRID
2007
IEEE
15 years 12 months ago
2007
IEEE
Abstract— Effective scheduling is critical for the performance of an application launched onto the Grid environment [11], [12]. Finding effective scheduling algorithms for this...