Sciweavers

1604 search results - page 210 / 321
» Approximation algorithms for developable surfaces
Sort
View
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 1 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
ICCV
1995
IEEE
15 years 5 months ago
Bayesian Decision Theory, the Maximum Local Mass Estimate, and Color Constancy
Computational vision algorithms are often developed in a Bayesian framework. Two estimators are commonly used: maximum a posteriori (MAP), and minimum mean squared error (MMSE). W...
William T. Freeman, David H. Brainard
TMI
2008
126views more  TMI 2008»
15 years 1 months ago
A Time Domain Fluorescence Tomography System for Small Animal Imaging
We describe the application of a time domain diffuse fluorescence tomography system for whole body small animal imaging. The key features of the system are the use of point excitat...
Anand T. N. Kumar, Scott B. Raymond, Andrew K. Dun...
ICIP
2005
IEEE
16 years 3 months ago
Segmentation and appearance model building from an image sequence
In this paper we explore the problem of accurately segmenting a person from a video given only approximate location of that person. Unlike previous work which assumes that the app...
Liang Zhao, Larry S. Davis
ICPR
2004
IEEE
16 years 2 months ago
Parameterisation Invariant Statistical Shape Models
In this paper novel theory to automate shape modelling is described. The main idea is to develop a theory that is intrinsically defined for curves, as opposed to a finite sample o...
Johan Karlsson, Anders Ericsson, Kalle Åstr&...