Sciweavers

1656 search results - page 30 / 332
» Labeling Schemes with Queries
Sort
View
NAACL
2007
13 years 9 months ago
Virtual Evidence for Training Speech Recognizers Using Partially Labeled Data
Collecting supervised training data for automatic speech recognition (ASR) systems is both time consuming and expensive. In this paper we use the notion of virtual evidence in a g...
Amarnag Subramanya, Jeff A. Bilmes
STACS
2007
Springer
14 years 1 months ago
Compact Forbidden-Set Routing
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Bruno Courcelle, Andrew Twigg
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 8 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
VLDB
2007
ACM
126views Database» more  VLDB 2007»
14 years 8 months ago
Querying Complex Structured Databases
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
Cong Yu, H. V. Jagadish
DBSEC
2007
116views Database» more  DBSEC 2007»
13 years 9 months ago
Provably-Secure Schemes for Basic Query Support in Outsourced Databases
In this paper, we take a closer look at the security of outsourced databases (aka Database-as-the-Service or DAS), a topic of emerging importance. DAS allows users to store sensit...
Georgios Amanatidis, Alexandra Boldyreva, Adam O'N...