Sciweavers

182 search results - page 21 / 37
» Simple Generalized Maximum Flow Algorithms
Sort
View
WWW
2005
ACM
14 years 8 months ago
Partitioning of Web graphs by community topology
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...
Hidehiko Ino, Mineichi Kudo, Atsuyoshi Nakamura
SP
2009
IEEE
128views Security Privacy» more  SP 2009»
14 years 2 months ago
Quantifying Information Leaks in Outbound Web Traffic
As the Internet grows and network bandwidth continues to increase, administrators are faced with the task of keeping confidential information from leaving their networks. Today’...
Kevin Borders, Atul Prakash
PERCOM
2006
ACM
14 years 7 months ago
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks
Consider a placement of heterogeneous, wireless sensors that can vary the transmission range by increasing or decreasing power. The problem of determining an optimal assignment of ...
Kenneth A. Berman, Fred S. Annexstein, Aravind Ran...
JMLR
2010
137views more  JMLR 2010»
13 years 2 months ago
HOP-MAP: Efficient Message Passing with High Order Potentials
There is a growing interest in building probabilistic models with high order potentials (HOPs), or interactions, among discrete variables. Message passing inference in such models...
Daniel Tarlow, Inmar Givoni, Richard S. Zemel
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 6 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer