Sciweavers

3532 search results - page 618 / 707
» Overlay networks with class
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 6 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
ICALP
2009
Springer
16 years 6 months ago
Functional Monitoring without Monotonicity
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [CMY08] to initiate a formal study of the communication cost of certain fu...
Chrisil Arackaparambil, Joshua Brody, Amit Chakrab...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
16 years 6 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
STACS
2010
Springer
16 years 1 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
SP
2008
IEEE
112views Security Privacy» more  SP 2008»
16 years 24 days ago
XFA: Faster Signature Matching with Extended Automata
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...
Randy Smith, Cristian Estan, Somesh Jha