Sciweavers

108 search results - page 10 / 22
» Hybrid Transitive Closure Algorithms
Sort
View
83
Voted
SEMWEB
2005
Springer
15 years 3 months ago
Benchmarking Database Representations of RDF/S Stores
Abstract. In this paper we benchmark three popular database representations of RDF/S schemata and data: (a) a schema-aware (i.e., one table per RDF/S class or property) with explic...
Yannis Theoharis, Vassilis Christophides, Gregory ...
ISOLA
2004
Springer
15 years 3 months ago
On model checking multiple hybrid views
We study consistency, satisfiability, and validity problems for collectively model checking a set of views endowed with labelled transitions, hybrid constraints on states, and ato...
Michael Huth, Altaf Hussain
CVPR
2004
IEEE
15 years 11 months ago
Detecting Unusual Activity in Video
We present an unsupervised technique for detecting unusual activity in a large video set using many simple features. No complex activity models and no supervised feature selection...
Hua Zhong, Jianbo Shi, Mirkó Visontai
93
Voted
CIKM
2010
Springer
14 years 8 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
EDBT
2008
ACM
128views Database» more  EDBT 2008»
15 years 9 months ago
Processing transitive nearest-neighbor queries in multi-channel access environments
Wireless broadcast is an efficient way for information dissemination due to its good scalability [10]. Existing works typically assume mobile devices, such as cell phones and PDAs...
Xiao Zhang, Wang-Chien Lee, Prasenjit Mitra, Baihu...