937 search results - page 112 / 188 » On the Complexity of Partial Order Properties |
170
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
160
click to vote
TCS
2008
15 years 6 months ago
2008
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
175
click to vote
VLDB
2002
ACM
15 years 5 months ago
2002
ACM
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
157
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Developing large-scale distributed applications can be a daunting task. One of the problems that application developers are confronted with is the distribution of data, processes, ...
262
click to vote
SIGGRAPH
2010
ACM
15 years 10 months ago
2010
ACM
Repeated elements are ubiquitous and abundant in both manmade and natural scenes. Editing such images while preserving the repetitions and their relations is nontrivial due to over...