Sciweavers

175 search results - page 5 / 35
» Partially Ordered Runs: A Case Study
Sort
View
ISMIS
2000
Springer
13 years 11 months ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
C. A. Johnson
VLDB
1993
ACM
138views Database» more  VLDB 1993»
13 years 11 months ago
Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
Justin Zobel, Alistair Moffat, Ron Sacks-Davis
DFT
2007
IEEE
152views VLSI» more  DFT 2007»
13 years 11 months ago
TMR and Partial Dynamic Reconfiguration to mitigate SEU faults in FPGAs
This paper presents the adoption of the Triple Modular Redundancy coupled with the Partial Dynamic Reconfiguration of Field Programmable Gate Arrays to mitigate the effects of Sof...
Cristiana Bolchini, Antonio Miele, Marco D. Santam...
ISMIR
2005
Springer
157views Music» more  ISMIR 2005»
14 years 25 days ago
A Partial Searching Algorithm and Its Application for Polyphonic Music Transcription
This paper proposes an algorithm for studying spectral contents of pitched sounds in real-world recordings. We assume that the 2nd -order difference, w.r.t. partial index, of a pi...
Wen Xue, M. Sandler
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 7 months ago
Single Parameter Combinatorial Auctions with Partially Public Valuations
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
Gagan Goel, Chinmay Karande, Lei Wang