Sciweavers

1736 search results - page 275 / 348
» The rank-width of Directed Graphs
Sort
View
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
16 years 4 months ago
LearnPADS: automatic tool generation from ad hoc data
In this demonstration, we will present LEARNPADS, a fully automatic system for generating ad hoc data processing tools. When presented with a collection of ad hoc data, the system...
Kathleen Fisher, David Walker, Kenny Qili Zhu
EDBT
2004
ACM
133views Database» more  EDBT 2004»
16 years 4 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum
ICSE
2004
IEEE-ACM
16 years 4 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury
DCC
2006
IEEE
16 years 3 months ago
Joint Source-Channel Decoding of Multiple Description Quantized Markov Sequences
This paper proposes a framework for joint source-channel decoding of Markov sequences that are coded by a fixed-rate multiple description quantizer (MDQ), and transmitted via a lo...
Xiaolin Wu, Xiaohan Wang
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
16 years 1 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar