Sciweavers

17018 search results - page 3231 / 3404
» From the How to the What
Sort
View
ICDT
2005
ACM
131views Database» more  ICDT 2005»
14 years 3 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
ICDT
2005
ACM
88views Database» more  ICDT 2005»
14 years 3 months ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan
ICFEM
2005
Springer
14 years 3 months ago
A Compositional Framework for Service Interaction Patterns and Interaction Flows
We provide precise high-level models for eight fundamental service interaction patterns, together with schemes for their composition into complex service-based business process int...
Alistair P. Barros, Egon Börger
IPSN
2005
Springer
14 years 3 months ago
The sensor selection problem for bounded uncertainty sensing models
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
Volkan Isler, Ruzena Bajcsy
IWQOS
2005
Springer
14 years 3 months ago
Processor Sharing Flows in the Internet
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and pr...
Nandita Dukkipati, Masayoshi Kobayashi, Rui Zhang-...
« Prev « First page 3231 / 3404 Last » Next »