Sciweavers

203 search results - page 4 / 41
» On Inducing Polygons and Related Problems
Sort
View
ML
2012
ACM
413views Machine Learning» more  ML 2012»
12 years 4 months ago
Gradient-based boosting for statistical relational learning: The relational dependency network case
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...
CCCG
2003
13 years 10 months ago
Curves of width one and the river shore problem
We consider the problem of finding the shortest curve in the plane that has unit width. This problem was first posed as the “river shore” puzzle by Ogilvy (1972) and is rela...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...
ESA
2007
Springer
133views Algorithms» more  ESA 2007»
14 years 2 months ago
Order Statistics in the Farey Sequences in Sublinear Time
We present the rst sublinear-time algorithms for computing order statistics in the Farey sequence and for the related problem of ranking. Our algorithms achieve a running times o...
Jakub Pawlewicz
TIP
2011
123views more  TIP 2011»
13 years 3 months ago
Spatial Sparsity-Induced Prediction (SIP) for Images and Video: A Simple Way to Reject Structured Interference
We propose a prediction technique that is geared toward forming successful estimates of a signal based on a correlated anchor signal that is contaminated with complex interference...
Gang Hua, Onur G. Guleryuz
COMPGEOM
2004
ACM
14 years 2 months ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir