Sciweavers

54 search results - page 11 / 11
» Cache-Based Model Checking of Networked Applications: From L...
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 7 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
SPAA
2004
ACM
14 years 23 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
TWC
2008
201views more  TWC 2008»
13 years 7 months ago
A Novel Algorithm for Multipath Fingerprinting in Indoor WLAN Environments
Abstract--Positioning in indoor wireless environments is growing rapidly in importance and gains commercial interests in context-awareness applications. The essential challenge in ...
Shih-Hau Fang, Tsung-Nan Lin, Kun-Chou Lee
SIGCOMM
1998
ACM
13 years 11 months ago
Secure Group Communications Using Key Graphs
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam