2652 search results - page 296 / 531 » Privacy-preserving linear programming |
156
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
119
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
124
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
—Using the well-known ATLAS and LAPACK dense linear algebra libraries, we demonstrate that the parallel management overhead (PMO) can grow with problem size on even statically sc...
131
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
158
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...