Sciweavers

10392 search results - page 1925 / 2079
» Introduction to Computer Science
Sort
View
118
Voted
ICALP
2009
Springer
16 years 29 days ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
16 years 25 days ago
The Claremont report on database research
In late May, 2008, a group of database researchers, architects, users and pundits met at the Claremont Resort in Berkeley, California to discuss the state of the research field an...
Rakesh Agrawal, Anastasia Ailamaki, Philip A. Bern...
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
16 years 24 days 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
123
Voted
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 24 days 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
ICDE
2010
IEEE
244views Database» more  ICDE 2010»
16 years 12 days 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
« Prev « First page 1925 / 2079 Last » Next »