1056 search results - page 189 / 212 » Constraint-Based Graph Matching |
81
Voted
DATE
1997
IEEE
15 years 6 months ago
1997
IEEE
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
195
Voted
IGIS
1994
15 years 6 months ago
1994
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
134
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
125
click to vote
FCCM
2004
IEEE
15 years 6 months ago
2004
IEEE
Intrusion detection for network security is a computation intensive application demanding high system performance. System level design, a relatively unexplored field in this area,...
115
click to vote
LICS
1997
IEEE
15 years 5 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...