Sciweavers

3991 search results - page 266 / 799
» Bounding homogeneous models
Sort
View
ICDAR
2009
IEEE
16 years 1 months ago
A Probabilistic Framework for Soft Target Learning in Online Cursive Handwriting Recognition
To develop effective learning algorithms for online cursive word recognition is still a challenge research issue. In this paper, we propose a probabilistic framework to model the ...
Xiaoyuan Zhu, Yong Ge, Feng-Jun Guo, Li-Xin Zhen
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
16 years 1 months ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem
INFOCOM
2008
IEEE
16 years 1 months ago
Embracing Interference in Ad Hoc Networks Using Joint Routing and Scheduling with Multiple Packet Reception
— We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity o...
Xin Wang, J. J. Garcia-Luna-Aceves
FOSSACS
2007
Springer
16 years 28 days ago
PDL with Intersection and Converse Is 2 EXP-Complete
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
Stefan Göller, Markus Lohrey, Carsten Lutz
FOCS
2006
IEEE
16 years 25 days ago
New Limits on Fault-Tolerant Quantum Computation
We show that quantum circuits cannot be made faulttolerant against a depolarizing noise level of ˆθ = (6 − 2 √ 2)/7 ≈ 45%, thereby improving on a previous bound of 50% (du...
Harry Buhrman, Richard Cleve, Monique Laurent, Noa...