Sciweavers

3897 search results - page 243 / 780
» complexity 2010
Sort
View
TKDE
2010
218views more  TKDE 2010»
15 years 1 months ago
LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
Yuzhe Tang, Shuigeng Zhou, Jianliang Xu
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
16 years 6 months ago
Interactive Physical Design Tuning
In the last decade, automated physical design tuning became a relevant area of research. The process of tuning a workload became more flexible but also more complex, and getting th...
Nicolas Bruno, Surajit Chaudhuri
STACS
2010
Springer
16 years 1 months ago
Inseparability and Strong Hypotheses for Disjoint NP Pairs
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP do...
Lance Fortnow, Jack H. Lutz, Elvira Mayordomo
ICCSA
2010
Springer
16 years 1 months ago
String Matching with Mismatches by Real-Valued FFT
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
Kensuke Baba
CICLING
2010
Springer
16 years 29 days ago
Chinese Event Descriptive Clause Splitting with Structured SVMs
: Chinese event descriptive clause splitting is the task of splitting a complex Chinese sentence into several clauses. In this paper, we present a discriminative approach for Chine...
Junsheng Zhou, Yabing Zhang, Xinyu Dai, Jiajun Che...