Sciweavers

2531 search results - page 196 / 507
» Group testing in graphs
Sort
View
COCOA
2009
Springer
15 years 11 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
SEMWEB
2005
Springer
15 years 12 months ago
Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
Herman J. ter Horst
DAM
2007
100views more  DAM 2007»
15 years 6 months ago
Memory management optimization problems for integrated circuit simulators
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
Timothée Bossart, Alix Munier Kordon, Franc...
CIKM
2005
Springer
15 years 12 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
ICOIN
2007
Springer
16 years 17 days ago
A Secure Message Percolation Scheme for Wireless Sensor Network
Wireless Sensor Network (WSN) deployed in hostile environments suffers from severe security threats. In this paper, we propose a Secure Message Percolation (SMP) scheme for WSN. We...
Md. Abdul Hamid, Choong Seon Hong