2695 search results - page 413 / 539 » Learning Graph Matching |
124
Voted
SODA
1998
ACM
15 years 3 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
141
click to vote
SIGCSE
2010
ACM
15 years 2 months ago
2010
ACM
Because of the growing importance of concurrent programming, many people are trying to figure out where in the curriculum to introduce students to concurrency. In this paper we di...
131
click to vote
AINA
2007
IEEE
15 years 2 months ago
2007
IEEE
Wireless sensor networks are usually deployed in a way “once deployed, never changed”. The actions of sensor nodes are either pre-scheduled inside chips or triggered to respon...
99
Voted
CGF
2007
15 years 2 months ago
2007
We present an example-based crowd simulation technique. Most crowd simulation techniques assume that the behavior exhibited by each person in the crowd can be defined by a restri...
118
click to vote
IJON
2006
15 years 2 months ago
2006
The goal of the visual correspondence problem is to establish a connectivity pattern (a mapping) between two images such that features projected from the same scene point are conn...