Sciweavers

2127 search results - page 88 / 426
» Computing large matchings fast
Sort
View
164
Voted
CVPR
2012
IEEE
13 years 6 months ago
Large scale metric learning from equivalence constraints
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
Martin Köstinger, Martin Hirzer, Paul Wohlhar...
143
Voted
DAC
1996
ACM
15 years 7 months ago
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
Hiroyuki Higuchi, Yusuke Matsunaga
202
Voted
CVPR
2009
IEEE
1517views Computer Vision» more  CVPR 2009»
16 years 11 months ago
Linear Solution to Scale and Rotation Invariant Object Matching
Images of an object undergoing ego- or camera- motion often appear to be scaled, rotated, and deformed versions of each other. To detect and match such distorted patterns to a s...
Hao Jiang, Stella X. Yu
150
Voted
ANCS
2007
ACM
15 years 7 months ago
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
Sailesh Kumar, Balakrishnan Chandrasekaran, Jonath...
134
Voted
ECAI
2006
Springer
15 years 7 months ago
Discovering Missing Background Knowledge in Ontology Matching
Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that corresp...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...