Sciweavers

110 search results - page 17 / 22
» Measuring linearity of planar point sets
Sort
View
SIAMREV
2010
170views more  SIAMREV 2010»
13 years 1 months ago
Network Properties Revealed through Matrix Functions
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
Ernesto Estrada, Desmond J. Higham
SI3D
2005
ACM
14 years 8 days ago
Texture sprites: texture elements splatted on surfaces
We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We ...
Sylvain Lefebvre, Samuel Hornus, Fabrice Neyret
ITC
2000
IEEE
88views Hardware» more  ITC 2000»
13 years 11 months ago
Predicting device performance from pass/fail transient signal analysis data
Transient Signal Analysis (TSA) is a Go/No-Go device testing method that is based on the analysis of voltage transients at multiple test points. In this paper, a technique based o...
James F. Plusquellic, Amy Germida, Jonathan Hudson...
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
13 years 8 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
MICCAI
2001
Springer
13 years 11 months ago
Multisubject Non-rigid Registration of Brain MRI Using Intensity and Geometric Features
In this article we merge point feature and intensity-based registration in a single algorithm to tackle the problem of multiple brain registration. Because of the high variability ...
Pascal Cachier, Jean-Francois Mangin, Xavier Penne...