Sciweavers

10392 search results - page 1631 / 2079
» Introduction to Computer Science
Sort
View
ICALP
2009
Springer
16 years 7 months ago
When Are Timed Automata Determinizable?
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
Christel Baier, Nathalie Bertrand, Patricia Bouyer...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 7 months ago
PicShark: mitigating metadata scarcity through large-scale P2P collaboration
With the commoditization of digital devices, personal information and media sharing is becoming a key application on the pervasive Web. In such a context, data annotation rather th...
Philippe Cudré-Mauroux, Adriana Budura, Manfred H...
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
16 years 7 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
16 years 7 months ago
Data Modelling versus Ontology Engineering
Ontologies in current computer science parlance are computer based resources that represent agreed domain semantics. Unlike data models, the fundamental asset of ontologies is the...
Peter Spyns, Robert Meersman, Mustafa Jarrar
ICSE
2007
IEEE-ACM
16 years 7 months ago
Bug Hunt: Making Early Software Testing Lessons Engaging and Affordable
Software testing efforts account for a large part of the software development costs. We still struggle, however, to properly prepare students to perform software testing activitie...
Sebastian G. Elbaum, Suzette Person, Jonathan Doku...
« Prev « First page 1631 / 2079 Last » Next »