Sciweavers

10051 search results - page 246 / 2011
» A Dynamic Separator Algorithm
Sort
View
AI
2000
Springer
15 years 6 months ago
Credal networks
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Evidence suggests that credal ...
Fabio Gagliardi Cozman
PR
2002
94views more  PR 2002»
15 years 6 months ago
Segmentation of touching and fused Devanagari characters
Devanagari script is a two dimensional composition of symbols. It is highly cumbersome to treat each composite character as a separate atomic symbol because such combinations are v...
Veena Bansal, R. M. K. Sinha
CADE
1999
Springer
15 years 10 months ago
A dynamic programming approach to categorial deduction
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
Philippe de Groote
ISORC
2008
IEEE
16 years 25 days ago
On Collaborative Scheduling of Distributable Real-Time Threads in Dynamic, Networked Embedded Systems
Some emerging networked embedded real-time applications have relatively long reaction time magnitudes—e.g., milliseconds to minutes. These longer execution time magnitudes allow...
Sherif Fadel Fahmy, Binoy Ravindran, E. Douglas Je...
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
15 years 7 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel