308 search results - page 42 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
ICDE
2010
IEEE
15 years 2 months ago
2010
IEEE
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
STOC
1996
ACM
15 years 1 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
JMLR
2006
14 years 9 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
80
Voted
GD
2004
Springer
15 years 3 months ago
2004
Springer
We study 3-dimensional layouts of the hypercube in a 1-active layer and general model. The problem can be understood as a graph drawing problem in 3D space and was addressed at Gr...