607 search results - page 33 / 122 » Unifying Exact Completions |
180
Voted
ICDE
2007
IEEE
16 years 8 days ago
2007
IEEE
Applications such as traffic management and resource scheduling for location-based services commonly need to identify regions with high concentrations of moving objects. Such quer...
COMBINATORICA
2007
14 years 11 months ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
107
Voted
CORR
2007
Springer
14 years 11 months ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
90
Voted
FUIN
2010
14 years 9 months ago
2010
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
ICCV
2005
IEEE
16 years 26 days ago
2005
IEEE
This paper presents a new surface content completion framework that can restore both shape and appearance from scanned, incomplete point set inputs. First, the geometric holes can...