Sciweavers

598 search results - page 98 / 120
» A random graph model for massive graphs
Sort
View
ISCIS
2004
Springer
15 years 5 months ago
Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
DAGSTUHL
2007
15 years 1 months ago
Weighted Voronoi Region Algorithms for Political Districting
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
Bruno Simeone, Federica Ricca, Andrea Scozzari
ATAL
2003
Springer
15 years 5 months ago
Resource-aware exploration of the emergent dynamics of simulated systems
The emerging science of simulation enables us to explore the dynamics of large and complex systems even if a formal representation and analysis of the system is intractable and a ...
Sven Brueckner, H. Van Dyke Parunak
ICWSM
2009
14 years 9 months ago
Content Based Recommendation and Summarization in the Blogosphere
This paper presents a stochastic graph based method for recommending or selecting a small subset of blogs that best represents a much larger set. within a certain topic. Each blog...
Ahmed Hassan, Dragomir R. Radev, Junghoo Cho, Amru...
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
15 years 4 months ago
Truthful assignment without money
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
Shaddin Dughmi, Arpita Ghosh