995 search results - page 23 / 199 » Wire-speed total order |
90
Voted
STACS
1994
Springer
15 years 1 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
180
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
The vast majority of work on skyline queries considers totally ordered domains, whereas in many applications some attributes are partially ordered, as for instance, domains of set ...
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
87
Voted
MICAI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...