Sciweavers

2652 search results - page 279 / 531
» Privacy-preserving linear programming
Sort
View
IPL
2000
82views more  IPL 2000»
15 years 3 months ago
Estimating the number of vertices of a polyhedron
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...
David Avis, Luc Devroye
164
Voted
CORR
1999
Springer
145views Education» more  CORR 1999»
15 years 3 months ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein
115
Voted
JLP
1998
147views more  JLP 1998»
15 years 3 months ago
Automated Reasoning with a Constraint-Based Metainterpreter
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
Henning Christiansen
101
Voted
TIT
2002
94views more  TIT 2002»
15 years 3 months ago
A generalized uncertainty principle and sparse representation in pairs of bases
An elementary proof of a basic uncertainty principle concerning pairs of representations of vectors in different orthonormal bases is provided. The result, slightly stronger than s...
Michael Elad, Alfred M. Bruckstein
122
Voted
ACL
2010
15 years 1 months ago
Untangling the Cross-Lingual Link Structure of Wikipedia
Wikipedia articles in different languages are connected by interwiki links that are increasingly being recognized as a valuable source of cross-lingual information. Unfortunately,...
Gerard de Melo, Gerhard Weikum