Sciweavers

158 search results - page 25 / 32
» Community Learning by Graph Approximation
Sort
View
PODS
2001
ACM
135views Database» more  PODS 2001»
14 years 7 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
IWPC
2006
IEEE
14 years 1 months ago
Alborz: An Interactive Toolkit to Extract Static and Dynamic Views of a Software System
: Alborz is a multi-view, interactive, and wizard-based software architecture reconstruction and evaluation toolkit that takes advantage of the Eclipse plug-in technology to provid...
Kamran Sartipi, Lingdong Ye, Hossein Safyallah
PLDI
2011
ACM
12 years 10 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
NIPS
2004
13 years 9 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
JMLR
2010
367views more  JMLR 2010»
13 years 2 months ago
Locally Linear Denoising on Image Manifolds
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
Dian Gong, Fei Sha, Gérard G. Medioni