Sciweavers

368 search results - page 52 / 74
» Advanced Computing and Communications Research under NSF Sup...
Sort
View
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
14 years 3 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
MOBISYS
2007
ACM
14 years 8 months ago
Real-time deployment of multihop relays for range extension
When the range of single-hop wireless communication is limited by distance or harsh radio propagation conditions, relays can be used to extend the communication range through mult...
Michael R. Souryal, Johannes Geissbuehler, Leonard...
SASN
2003
ACM
14 years 1 months ago
SECTOR: secure tracking of node encounters in multi-hop wireless networks
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
Srdjan Capkun, Levente Buttyán, Jean-Pierre...
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
14 years 2 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
PODC
1989
ACM
14 years 16 days ago
Knowledge, Probability, and Adversaries
: What should it mean for an agent to know or believe an assertion is true with probability :99? Di erent papers FH88, FZ88, HMT88] give di erent answers, choosing to use quite di ...
Joseph Y. Halpern, Mark R. Tuttle