1348 search results - page 100 / 270 » Matching planar maps |
118
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
101
Voted
E2EMON
2006
IEEE
15 years 6 months ago
2006
IEEE
—The traffic dynamics of the Internet’s dominant applications, such as peer-to-peer and multimedia, worsen the accuracy of the existing application traffic identification. Ther...
141
click to vote
IPMI
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and atlasing, although quite accurate, can require long ...
193
Voted
SIGMOD
2008
ACM
16 years 27 days ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
100
click to vote
FGR
2008
IEEE
15 years 7 months ago
2008
IEEE
In recent years, 3D face recognition has obtained much attention. Using 2D face image as probe and 3D face data as gallery is an alternative method to deal with computation comple...