Sciweavers

848 search results - page 137 / 170
» Randomness and the linear degrees of computability
Sort
View
SPAA
2004
ACM
15 years 5 months ago
Online hierarchical cooperative caching
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun V...
DAC
1989
ACM
15 years 3 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong
EUROCRYPT
2004
Springer
15 years 3 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
ICASSP
2010
IEEE
14 years 10 months ago
A novel, fast, and complete 3D segmentation of vertebral bones
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs), especially the trabecular bones (TBs). In this paper...
Melih S. Aslan, Asem M. Ali, Ham Rara, Ben Arnold,...
SAC
2011
ACM
14 years 6 months ago
Stochastic matching pursuit for Bayesian variable selection
This article proposes a stochastic version of the matching pursuit algorithm for Bayesian variable selection in linear regression. In the Bayesian formulation, the prior distributi...
Ray-Bing Chen, Chi-Hsiang Chu, Te-You Lai, Ying Ni...