15033 search results - page 263 / 3007 » Complexity Theory and Algorithms |
176
click to vote
SIGIR
2012
ACM
13 years 7 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
152
click to vote
ICIP
2003
IEEE
16 years 6 months ago
2003
IEEE
Knowing the background image of a video scene simplifies the general video-object segmentation problem and therefore it is required by several automatic segmentation algorithms. T...
107
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
112
click to vote
WDAG
2005
Springer
15 years 10 months ago
2005
Springer
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
132
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...