Sciweavers

894 search results - page 49 / 179
» Universal Relations and
Sort
View
SIGCSE
2002
ACM
125views Education» more  SIGCSE 2002»
13 years 7 months ago
Small-college supercomputing: building a Beowulf cluster at a comprehensive college
A Beowulf cluster is a MIMD multiprocessor built from commodity off-the-shelf personal computers connected via a dedicated network, running free open-source software. Such a clust...
Joel C. Adams, David Vos
ADC
2005
Springer
111views Database» more  ADC 2005»
14 years 1 months ago
An Access Control Method Based on the Prefix Labeling Scheme for XML Repositories
This paper describes an access control method of the XML repository system, SAXOPHONE, which was implemented at Tokyo Metropolitan University. The main feature of our research is ...
Shohei Yokoyama, Manabu Ohta, Kaoru Katayama, Hiro...
PLDI
2004
ACM
14 years 1 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....
BIRTHDAY
2006
Springer
13 years 11 months ago
Eliminating Dependent Pattern Matching
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
Healfdene Goguen, Conor McBride, James McKinna
DASFAA
2006
IEEE
141views Database» more  DASFAA 2006»
14 years 2 months ago
Dataspaces: A New Abstraction for Information Management
straction for Information Management Michael Franklin University of California, Berkeley Alon Halevy Google Inc. and U. Washington David Maier Portland State University The develo...
Alon Y. Halevy, Michael J. Franklin, David Maier