254 search results - page 25 / 51 » Binary amiable Words |
TCS
1998
14 years 10 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
125
click to vote
SIGOPS
2011
14 years 6 months ago
2011
While application performance and power-efficiency are both important, application correctness is even more important. In other words, if the application is misbehaving, it is li...
115
click to vote
ICIP
2001
IEEE
16 years 17 days ago
2001
IEEE
Document images undergo various degradation processes. Numerous models of these degradation processes have been proposed in the literature. In this paper we propose a modelbased r...
SIAMCOMP
1998
14 years 10 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
NAACL
2010
14 years 9 months ago
2010
Out-of-vocabulary (OOV) words represent an important source of error in large vocabulary continuous speech recognition (LVCSR) systems. These words cause recognition failures, whi...