5740 search results - page 974 / 1148 » Application of Level Set Methods in Computer Vision |
121
click to vote
MFCS
1997
Springer
15 years 6 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
127
Voted
GG
2010
Springer
15 years 2 months ago
2010
Springer
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...
139
Voted
COLING
2010
14 years 9 months ago
2010
We study a novel shallow information extraction problem that involves extracting sentences of a given set of topic categories from medical forum data. Given a corpus of medical fo...
106
Voted
IEEEPACT
2006
IEEE
15 years 8 months ago
2006
IEEE
Modern out-of-order processors with non-blocking caches exploit Memory-Level Parallelism (MLP) by overlapping cache misses in a wide instruction window. The exploitation of MLP, h...
135
click to vote
ETT
2002
15 years 2 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...