Sciweavers

2735 search results - page 186 / 547
» Comparing notions of randomness
Sort
View
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 7 months ago
Detecting Communities in Social Networks Using Max-Min Modularity.
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Jiyang Chen, Osmar R. Zaïane, Randy Goebel
ALT
2006
Springer
14 years 7 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
TCC
2010
Springer
208views Cryptology» more  TCC 2010»
14 years 7 months ago
Rationality in the Full-Information Model
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
Ronen Gradwohl
AINA
2009
IEEE
14 years 5 months ago
A Topology Control Protocol for 2D Poisson Distributed Wireless Sensor Networks
—Topology control in a wireless sensor network is useful for ensuring that the network remains connected in the presence of nodes that exhaust their energy or become altogether d...
Waltenegus Dargie, Alexander Schill, Rami Mochaour...
ASUNAM
2009
IEEE
14 years 5 months ago
Social Network Discovery Based on Sensitivity Analysis
—This paper presents a novel methodology for social network discovery based on the sensitivity coefficients of importance metrics, namely the Markov centrality of a node, a metr...
Tarik Crnovrsanin, Carlos D. Correa, Kwan-Liu Ma