1381 search results - page 228 / 277 » Computational Complexity of Constraint Satisfaction |
143
Voted
DSN
2002
IEEE
15 years 8 months ago
2002
IEEE
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...
130
click to vote
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
117
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
161
Voted
EMMCVPR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The complexity of visual representations is substantially limited by the compositional nature of our visual world which, therefore, renders learning structured object mod...
136
Voted
EGH
2003
Springer
15 years 9 months ago
2003
Springer
Current graphics hardware can render procedurally shaded objects in real-time. However, due to resource and performance limitations, interactive shaders can not yet approach the c...