10988 search results - page 273 / 2198 » Algorithmic Folding Complexity |
136
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
110
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
147
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Background modeling plays an important role in video surveillance, yet in complex scenes it is still a challenging problem. Among many difficulties, problems caused by illuminatio...
171
click to vote
DLOG
2006
15 years 5 months ago
2006
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
151
click to vote
EACL
1993
ACL Anthology
15 years 5 months ago
1993
ACL Anthology
Linguistic access to uncertain quantitative knowledge about physical properties is provided by dimensional adjectives, e.g. long-short in the spatial and temporal senses, near-far...