Sciweavers

4865 search results - page 596 / 973
» The Complexity of Graph Connectivity
Sort
View
ACTA
2002
111views more  ACTA 2002»
15 years 6 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
COMCOM
2004
81views more  COMCOM 2004»
15 years 6 months ago
A performance anomaly in clustered on-line transaction processing systems
This paper presents a simulation study on complex On-Line Transaction Processing systems using TPC-C workload. The impacts on the response time of Inter-Connection Network (ICN) i...
Hong Cai, Hisao Kameda, Jie Li
EMNLP
2010
15 years 4 months ago
Predicting the Semantic Compositionality of Prefix Verbs
In many applications, replacing a complex word form by its stem can reduce sparsity, revealing connections in the data that would not otherwise be apparent. In this paper, we focu...
Shane Bergsma, Aditya Bhargava, Hua He, Grzegorz K...
LPAR
2010
Springer
15 years 4 months ago
On the Satisfiability of Two-Variable Logic over Data Words
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
Claire David, Leonid Libkin, Tony Tan
ICDAR
2009
IEEE
15 years 4 months ago
Clutter Noise Removal in Binary Document Images
The paper presents a clutter detection and removal algorithm for complex document images. The distance transform based approach is independent of clutter's position, size, sh...
Mudit Agrawal, David S. Doermann