Sciweavers

715 search results - page 63 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 9 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
DAC
2008
ACM
14 years 11 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
APPROX
2006
Springer
117views Algorithms» more  APPROX 2006»
14 years 1 months ago
Fractional Matching Via Balls-and-Bins
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
ECOOP
2003
Springer
14 years 3 months ago
LeakBot: An Automated and Lightweight Tool for Diagnosing Memory Leaks in Large Java Applications
Despite Java’s automatic reclamation of memory, memory leaks remain an important problem. For example, we frequently encounter memory leaks that cause production servers to crash...
Nick Mitchell, Gary Sevitsky
ICUMT
2009
13 years 7 months ago
sDLS - Distributed Least Squares localization for large Wireless Sensor Networks
Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspect of WSN research is location estimation. As a good solut...
Ralf Behnke, Jakob Salzmann, Dominik Lieckfeldt, D...