Sciweavers

25 search results - page 5 / 5
» Scalable join processing on very large RDF graphs
Sort
View
GEOS
2007
Springer
13 years 11 months ago
Supporting Complex Thematic, Spatial and Temporal Queries over Semantic Web Data
Spatial and temporal data are critical components in many applications. This is especially true in analytical domains such as national security and criminal investigation. Often, t...
Matthew Perry, Amit P. Sheth, Farshad Hakimpour, P...
DCOSS
2006
Springer
13 years 8 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
ASPDAC
2005
ACM
113views Hardware» more  ASPDAC 2005»
13 years 10 months ago
Scalable interprocedural register allocation for high level synthesis
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
Rami Beidas, Jianwen Zhu
CN
2010
136views more  CN 2010»
13 years 5 months ago
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 5 months ago
Acdmcp: An adaptive and completely distributed multi-hop clustering protocol for wireless sensor networks
Clustering is a very popular network structuring technique which mainly addresses the issue of scalability in large scale Wireless Sensor Networks. Additionally, it has been shown...
Khalid Nawaz, Alejandro P. Buchmann