Sciweavers

2434 search results - page 262 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 4 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
CVPR
2006
IEEE
15 years 10 months ago
A Generalized EM Approach for 3D Model Based Face Recognition under Occlusions
This paper describes an algorithm for pose and illumination invariant face recognition from a single image under occlusions. The method iteratively estimates the parameters of a 3...
Michael De Smet, Rik Fransens, Luc J. Van Gool
IROS
2006
IEEE
105views Robotics» more  IROS 2006»
15 years 10 months ago
Combinatorial Optimization of Sensing for Rule-Based Planar Distributed Assembly
Abstract— We describe a model for planar distributed assembly, in which agents move randomly and independently on a twodimensional grid, joining square blocks together to form a ...
Jonathan Kelly, Hong Zhang
AINA
2004
IEEE
15 years 7 months ago
RED with Optimized Dynamic Threshold Deployment on Shared Buffer
Prior survey of RED algorithm deployment on multiqueue system with shared buffer was unfair and sensitive to congestion level by statically setting the parameters. In this paper, ...
Chengchen Hu, Bin Liu
WSCG
2004
217views more  WSCG 2004»
15 years 5 months ago
Blending Textured Images Using a Non-parametric Multiscale MRF Method
In this paper we describe a new method for improving the representation of textures in blends of multiple images based on a Markov Random Field (MRF) algorithm. We show that direc...
Bernard Tiddeman