Sciweavers

3466 search results - page 240 / 694
» Fast computation of special resultants
Sort
View
COLOGNETWENTE
2010
15 years 5 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak
JAR
2010
100views more  JAR 2010»
15 years 5 months ago
Geometry Constructions Language
We give a short survey of the main principles of our software for the visualisation and animation in mathematics and study the visibility and contour problems in the representation...
Predrag Janicic
WWW
2007
ACM
16 years 7 months ago
A high-performance interpretive approach to schema-directed parsing
XML delivers key advantages in interoperability due to its flexibility, expressiveness, and platform-neutrality. As XML has become a performance-critical aspect of the next genera...
Morris Matsa, Eric Perkins, Abraham Heifets, Marga...
ICDAR
2009
IEEE
15 years 4 months ago
Recurrent HMMs and Cursive Handwriting Recognition Graphs
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
Marc-Peter Schambach
FGCS
2000
101views more  FGCS 2000»
15 years 6 months ago
VRML as means of expressive 4D illustration in CAM education
Computer graphics (CGr) lies in the fundaments of computer aided engineering (CAE). As a result from the fast development in both CGr and CAE, more and more computer aided systems...
Nikolay Avgoustinov