Sciweavers

2475 search results - page 370 / 495
» On the accuracy of language trees
Sort
View
ICDE
2001
IEEE
106views Database» more  ICDE 2001»
14 years 9 months ago
Querying XML Documents Made Easy: Nearest Concept Queries
Due to the ubiquity and popularity of XML, users often are in the following situation: they want to query XML documents which contain potentially interesting information but they ...
Albrecht Schmidt 0002, Martin L. Kersten, Menzo Wi...
SIGSOFT
2006
ACM
14 years 8 months ago
User guidance for creating precise and accessible property specifications
Property specifications concisely describe aspects of what a system is supposed to do. No matter what notation is used to describe them, however, it is difficult to represent thes...
Rachel L. Cobleigh, George S. Avrunin, Lori A. Cla...
POPL
2009
ACM
14 years 8 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
14 years 8 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
TLDI
2005
ACM
135views Formal Methods» more  TLDI 2005»
14 years 1 months ago
Types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Michael F. Ringenburg, Dan Grossman