Sciweavers

5922 search results - page 181 / 1185
» Navigability of Complex Networks
Sort
View
JSAC
2008
140views more  JSAC 2008»
15 years 3 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
BMCBI
2004
98views more  BMCBI 2004»
15 years 2 months ago
STING Millennium Suite: integrated software for extensive analyses of 3d structures of proteins and their complexes
Background: The integration of many aspects of protein/DNA structure analysis is an important requirement for software products in general area of structural bioinformatics. In fa...
Roberto H. Higa, Roberto C. Togawa, Arnaldo J. Mon...
TIT
2010
87views Education» more  TIT 2010»
14 years 9 months ago
Silence-based communication
We consider a power-efficient communication model for wireless sensor networks where silence is used to convey information. We study the average-case and worstcase complexities of ...
Anand K. Dhulipala, Christina Fragouli, Alon Orlit...
EJC
2000
15 years 4 months ago
A Communicating Tree Model for Generating Network Applications
We present a new model for generating network applications. Our model is based on trees communicating with each other. Our model is simple to understand, but yet powerful enough to...
Tomohiro Matsuzaki, Takehiro Tokuda
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 3 months ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin