3702 search results - page 163 / 741 » All Pairings Are in a Group |
143
click to vote
CCCG
2009
15 years 7 months ago
2009
All known examples of generic 3D bar-and-joint frameworks where the distance between a non-edge pair is implied by the edges in the graph contain a rigid vertexinduced subgraph. I...
171
click to vote
ACTA
2007
15 years 6 months ago
2007
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
124
click to vote
AMC
2007
15 years 6 months ago
2007
In this paper, we study the nonlinear boundary value problem ÀDu þ u ¼ fuðu; vÞ in X; ÀDv þ v ¼ fvðu; vÞ in X; ou on ¼ guðu; vÞ; ov on ¼ gvðu; vÞ on oX; 8 ><...
198
click to vote
ECCC
2010
15 years 6 months ago
2010
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
172
click to vote
DISOPT
2008
15 years 6 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...