Sciweavers

3471 search results - page 633 / 695
» Obstacle Numbers of Graphs
Sort
View
ESWS
2009
Springer
15 years 2 months ago
Applied Temporal RDF: Efficient Temporal Querying of RDF Data with SPARQL
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
Jonas Tappolet, Abraham Bernstein
IC
2009
15 years 2 months ago
Language Based Crawling: Crawling the Arabic Content of the Web
- Crawling web pages written in Arabic or any other language with limited content in the web may, at first, seem to parallel the process of crawling the English content. However, t...
Saad H. Alabbad, Sultan Alanazi
IEAAIE
2009
Springer
15 years 2 months ago
Plan Repair in Conflict-Free Routing
In conflict-free routing a set of agents have to traverse a common infrastructure without interfering with each other. Maza and Castagna [1] showed how route plans can be repaired ...
Adriaan ter Mors, Cees Witteveen
IEEESCC
2009
IEEE
15 years 2 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
AISS
2010
115views more  AISS 2010»
15 years 1 months ago
Network Connection and Perfectly Secure Message Transmission on Wireless Mobile Networks
In this paper we proposed perfectly secure message transmission for reliable and secure communications in order to ensure that an adversary cannot obtain information (in the infor...
Sun-Young Lee