Sciweavers

3758 search results - page 46 / 752
» A Complete Subsumption Algorithm
Sort
View
ATAL
2003
Springer
14 years 26 days ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
CG
2007
Springer
13 years 7 months ago
Gradient based image completion by solving the Poisson equation
This paper presents a novel gradient-based image completion algorithm for removing significant objects from natural images or photographs. Our method reconstructs the region of r...
Jianbing Shen, Xiaogang Jin, Chuan Zhou, Charlie C...
IPL
2008
84views more  IPL 2008»
13 years 7 months ago
Minimal proper interval completions
Given an arbitrary graph G = (V, E) and a proper interval graph H = (V, F) with E F we say that H is a proper interval completion of G. The graph H is called a minimal proper inte...
Ivan Rapaport, Karol Suchan, Ioan Todinca
COMPGEOM
2010
ACM
14 years 21 days ago
3D Euler spirals for 3D curve completion
Shape completion is an intriguing problem in geometry processing with applications in CAD and graphics. This paper defines a new type of 3D curves, which can be utilized for curv...
Gur Harary, Ayellet Tal
CG
2008
Springer
13 years 9 months ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003