Sciweavers

7006 search results - page 517 / 1402
» Approximation Algorithms
Sort
View
PODS
2003
ACM
143views Database» more  PODS 2003»
16 years 6 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
MICCAI
2002
Springer
16 years 7 months ago
Incorporating Non-rigid Registration into Expectation Maximization Algorithm to Segment MR Images
Abstract. The paper introduces an algorithm which allows the automatic segmentation of multi channel magnetic resonance images. We extended the Expectation Maximization-Mean Field ...
Kilian M. Pohl, William M. Wells III, Alexandre Gu...
ACST
2006
15 years 7 months ago
A novel algorithm for synthesizing directional temporal texture animation
In this paper, we propose a novel algorithm for directional temporal texture synthesis. The generated temporal textures can move in any user-specified direction at run time, while...
Chao-Hung Lai, Jiunn-Lin Wu
COMPGEOM
2005
ACM
15 years 8 months ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
Jonathan Richard Shewchuk
CVPR
2012
IEEE
13 years 9 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn