Sciweavers

5263 search results - page 144 / 1053
» Data sources selection for XML data sources
Sort
View
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
14 years 12 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
TSP
2011
125views more  TSP 2011»
14 years 4 months ago
Weight Adjusted Tensor Method for Blind Separation of Underdetermined Mixtures of Nonstationary Sources
—In this paper, a novel algorithm to blindly separate an instantaneous linear underdetermined mixture of nonstationary sources is proposed. It means that the number of sources ex...
Petr Tichavský, Zbynek Koldovský
EMNLP
2011
13 years 9 months ago
Multi-Source Transfer of Delexicalized Dependency Parsers
We present a simple method for transferring dependency parsers from source languages with labeled training data to target languages without labeled training data. We first demons...
Ryan T. McDonald, Slav Petrov, Keith Hall
ALGORITHMICA
1998
75views more  ALGORITHMICA 1998»
14 years 9 months ago
Average Case Analyses of List Update Algorithms, with Applications to Data Compression
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...
Susanne Albers, Michael Mitzenmacher
ICDE
2008
IEEE
209views Database» more  ICDE 2008»
15 years 11 months ago
Distributed Monitoring of Peer-to-Peer Systems
In this paper, we are concerned with the distributed monitoring of P2P systems. We introduce the P2P Monitor system and a new declarative language, namely P2PML, for specifying mo...
Serge Abiteboul, Bogdan Marinoiu, Pierre Bourhis