Sciweavers

496 search results - page 56 / 100
» Machine models and lower bounds for query processing
Sort
View
EDBT
2009
ACM
174views Database» more  EDBT 2009»
14 years 2 months ago
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...
Goce Trajcevski, Roberto Tamassia, Hui Ding, Peter...
BMCBI
2006
75views more  BMCBI 2006»
13 years 7 months ago
A machine learning strategy to identify candidate binding sites in human protein-coding sequence
Background: The splicing of RNA transcripts is thought to be partly promoted and regulated by sequences embedded within exons. Known sequences include binding sites for SR protein...
Thomas Down, Bernard Leong, Tim J. P. Hubbard
WISE
2002
Springer
14 years 20 days ago
An MDP-based Peer-to-Peer Search Server Network
A distributed search system consists of a large number of autonomous search servers logically connected in a peerto-peer network. Each search server maintains a local index of a c...
Yipeng Shen, Dik Lun Lee
JMLR
2008
129views more  JMLR 2008»
13 years 7 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
IPPS
2010
IEEE
13 years 5 months ago
Scalability analysis of embarassingly parallel applications on large clusters
This work presents a scalability analysis of embarrassingly parallel applications running on cluster and multi-cluster machines. Several applications can be included in this catego...
Fabrício Alves Barbosa da Silva, Hermes Sen...