Sciweavers

4926 search results - page 222 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
CVPR
2012
IEEE
13 years 8 months ago
Curvature-based regularization for surface approximation
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...
Carl Olsson, Yuri Boykov
184
Voted
PPOPP
2012
ACM
14 years 1 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
15 years 6 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
TKDE
2010
160views more  TKDE 2010»
15 years 4 months ago
Using Proximity Search to Estimate Authority Flow
—Authority flow and proximity search have been used extensively in measuring the association between entities in data graphs, ranging from the Web to relational and XML database...
Vagelis Hristidis, Yannis Papakonstantinou, Ramakr...
SMA
2009
ACM
130views Solid Modeling» more  SMA 2009»
16 years 26 days ago
A symbolic-numerical envelope algorithm using quadratic MOS patches
In this paper, we describe an algorithm for generating an exact rational envelope of a two-parameter family of spheres given by a quadratic patch in R3,1 , which is considered as ...
Bohumír Bastl, Jirí Kosinka, Mirosla...