2479 search results - page 482 / 496 » Random Event Structures |
DAGSTUHL
2007
13 years 9 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
ICVGIP
2008
13 years 9 months ago
2008
Constructing a high-resolution (HR) image from lowresolution (LR) image(s) has been a very active research topic recently with focus shifting from multi-frames to learning based s...
AAAI
2006
13 years 9 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
ACL
2006
13 years 9 months ago
2006
This paper shows that a simple two-stage approach to handle non-local dependencies in Named Entity Recognition (NER) can outperform existing approaches that handle non-local depen...
NIPS
2000
13 years 8 months ago
2000
Source separation, or computational auditory scene analysis, attempts to extract individual acoustic objects from input which contains a mixture of sounds from different sources, ...