Sciweavers

1272 search results - page 151 / 255
» The Set Cover with Pairs Problem
Sort
View
NIPS
2008
14 years 2 days ago
Stochastic Relational Models for Large-scale Dyadic Data using MCMC
Stochastic relational models (SRMs) [15] provide a rich family of choices for learning and predicting dyadic data between two sets of entities. The models generalize matrix factor...
Shenghuo Zhu, Kai Yu, Yihong Gong
COMPGEOM
2004
ACM
14 years 4 months ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
FOCS
1999
IEEE
14 years 2 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
BMCBI
2010
86views more  BMCBI 2010»
13 years 10 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
ICCV
2001
IEEE
15 years 17 days ago
Stereoscopic Segmentation
We cast the problem of multiframe stereo reconstruction of a smooth shape as the global region segmentation of a collection of images of the scene. Dually, the problem of segmenti...
Anthony J. Yezzi, Stefano Soatto