674 search results - page 2 / 135 » Lower Bounds on the Computational Power of an Optical Model ... |
ENDM
2010
13 years 5 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
FMCAD
2004
Springer
13 years 10 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
ECCC
2007
13 years 5 months ago
2007
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
COR
2008
13 years 5 months ago
2008
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...