Sciweavers

107 search results - page 18 / 22
» Reasoning on regular path queries
Sort
View
IS
2007
13 years 9 months ago
Schema-conscious XML indexing
User queries on extensible markup language (XML) documents are typically expressed as regular path expressions. A variety of indexing techniques for efficiently retrieving the re...
Krishna P. Leela, Jayant R. Haritsa
ICML
2009
IEEE
14 years 10 months ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...
CCS
2006
ACM
14 years 1 months ago
EXE: automatically generating inputs of death
This paper presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input,...
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, ...
SIGMOD
2010
ACM
215views Database» more  SIGMOD 2010»
14 years 1 months ago
Dynamic symbolic database application testing
A database application differs form regular applications in that some of its inputs may be database queries. The program will execute the queries on a database and may use any re...
Chengkai Li, Christoph Csallner
SIGMETRICS
2010
ACM
180views Hardware» more  SIGMETRICS 2010»
13 years 8 months ago
Route oracle: where have all the packets gone?
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...
Yaping Zhu, Jennifer Rexford, Subhabrata Sen, Aman...