4343 search results - page 90 / 869 » Improving Visual Matching |
WSTST
2005
Springer
15 years 6 months ago
2005
Springer
: In two-sided matching problem, there are overwhelming evidences that support peoples are also motivated by concerns for fairness and reciprocity. We will show that compromise whi...
89
Voted
IPL
2006
15 years 21 days ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
JACM
2010
14 years 11 months ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
114
Voted
AINA
2008
IEEE
15 years 7 months ago
2008
IEEE
—With the increasing growth of the Internet, the explosion of attacks and viruses significantly affects the network security. Network Intrusion Detection System (NIDS) is develop...
113
click to vote
ENTCS
2006
15 years 22 days ago
2006
Model transformation tools implemented using graph transformation techniques are often expected to provide high performance. For this reason, in the Graph Rewriting and Transforma...