Sciweavers

820 search results - page 128 / 164
» Finding low-utility data structures
Sort
View
VLDB
2008
ACM
196views Database» more  VLDB 2008»
14 years 9 months ago
Modelling retrieval models in a probabilistic relational algebra with a new operator: the relational Bayes
This paper presents a probabilistic relational modelling (implementation) of the major probabilistic retrieval models. Such a high-level implementation is useful since it supports ...
Thomas Rölleke, Hengzhi Wu, Jun Wang, Hany Azzam
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 8 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...
DCC
2006
IEEE
14 years 8 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
VL
2008
IEEE
171views Visual Languages» more  VL 2008»
14 years 3 months ago
Usability challenges for enterprise service-oriented architecture APIs
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...
Jack Beaton, Sae Young Jeong, Yingyu Xie, Jeffrey ...
CCGRID
2007
IEEE
14 years 3 months ago
Relative Performance of Scheduling Algorithms in Grid Environments
Abstract— Effective scheduling is critical for the performance of an application launched onto the Grid environment [11], [12]. Finding effective scheduling algorithms for this...
Yang Zhang, Charles Koelbel, Ken Kennedy