1348 search results - page 100 / 270 » Matching planar maps |
SODA
2012
ACM
12 years 17 days 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,...
E2EMON
2006
IEEE
14 years 4 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...
IPMI
2011
Springer
13 years 1 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 ...
SIGMOD
2008
ACM
14 years 10 months 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...
FGR
2008
IEEE
14 years 4 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...