Sciweavers

10304 search results - page 1912 / 2061
» Computer science with the sciences: an emphasis in computati...
Sort
View
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
16 years 1 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 1 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
112
Voted
ICDE
2010
IEEE
244views Database» more  ICDE 2010»
16 years 1 months ago
Reliable Storage and Querying for Collaborative Data Sharing Systems
The sciences, business confederations, and medicine urgently need infrastructure for sharing data and updates among collaborators' constantly changing, heterogeneous databases...
Nicholas E. Taylor, Zachary G. Ives
MOBISYS
2007
ACM
16 years 1 months ago
Improving mobile database access over wide-area networks without degrading consistency
We report on the design, implementation, and evaluation of a system called Cedar that enables mobile database access with good performance over low-bandwidth networks. This is acc...
Niraj Tolia, Mahadev Satyanarayanan, Adam Wolbach
MOBIHOC
2007
ACM
16 years 1 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
« Prev « First page 1912 / 2061 Last » Next »