Sciweavers

1941 search results - page 205 / 389
» On the Hardness of Approximate Reasoning
Sort
View
VISUALIZATION
1998
IEEE
15 years 10 months ago
Large scale terrain visualization using the restricted quadtree triangulation
Real-time rendering of triangulated surfaces has attracted growing interest in the last few years. However, interactive visualization of very large scale grid digital elevation mo...
Renato Pajarola
ALT
1997
Springer
15 years 10 months ago
Learning DFA from Simple Examples
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
Rajesh Parekh, Vasant Honavar
ASPDAC
2008
ACM
174views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Chebyshev Affine Arithmetic based parametric yield prediction under limited descriptions of uncertainty
In modern circuit design, it is difficult to provide reliable parametric yield prediction since the real distribution of process data is hard to measure. Most existing approaches ...
Jin Sun, Yue Huang, Jun Li, Janet Meiling Wang
CEAS
2005
Springer
15 years 8 months ago
Computers beat Humans at Single Character Recognition in Reading based Human Interaction Proofs (HIPs)
Human interaction proofs (HIPs) have become commonplace on the internet for protecting free online services from abuse by automated scripts/bots. They are challenges designed to b...
Kumar Chellapilla, Kevin Larson, Patrice Y. Simard...
ICDIM
2007
IEEE
15 years 8 months ago
Predicting durability in DHTs using Markov chains
We consider the problem of data durability in lowbandwidth large-scale distributed storage systems. Given the limited bandwidth between replicas, these systems suffer from long re...
Fabio Picconi, Bruno Baynat, Pierre Sens