9842 search results - page 434 / 1969 » The Complexity of the Matching-Cut Problem |
171
click to vote
NIPS
2004
15 years 6 months ago
2004
Saliency mechanisms play an important role when visual recognition must be performed in cluttered scenes. We propose a computational definition of saliency that deviates from exis...
122
click to vote
WSPI
2004
15 years 6 months ago
2004
In the main research of internet-computing enabled knowledge management, we use some of the most advanced research scenarios, arguing that we critically need a system approach to q...
130
click to vote
AAAI
2000
15 years 6 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
121
click to vote
AAAI
1997
15 years 6 months ago
1997
In this paper, we present a novel first order theorem proving strategy - ordered semantic hyper linking. Ordered semantic hyper linking (OSHL) is an instance-based refutational th...
138
Voted
DEDUCTIVE
1994
15 years 6 months ago
1994
Given an intensional database (IDB) and an extension database (EDB), the view update problem translates updates on the IDB into updates on the EDB. One approach to the view update...