Sciweavers

845 search results - page 66 / 169
» Complexity Dimensions and Learnability
Sort
View
134
Voted
AMFG
2007
IEEE
255views Biometrics» more  AMFG 2007»
15 years 4 months ago
A New Probabilistic Model for Recognizing Signs with Systematic Modulations
Abstract. This paper addresses an aspect of sign language (SL) recognition that has largely been overlooked in previous work and yet is integral to signed communication. It is the ...
Sylvie C. W. Ong, Surendra Ranganath
108
Voted
RTA
2010
Springer
15 years 4 months ago
Polynomially Bounded Matrix Interpretations
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
Johannes Waldmann
99
Voted
ACSD
2006
IEEE
76views Hardware» more  ACSD 2006»
15 years 4 months ago
Specification and Verification of Dynamic Communication Systems
Dynamic communication systems (DCS) are complex because of their unboundedness in several dimensions. They have an unbounded and changing number of objects, a dynamically changing...
Jörg Bauer, Ina Schaefer, Tobe Toben, Bernd W...
JDWM
2008
120views more  JDWM 2008»
15 years 22 days ago
Algebraic and Graphic Languages for OLAP Manipulations
This article deals with multidimensional analyses. Analyzed data are designed according to a conceptual model as a constellation of facts and dimensions, which are composed of mul...
Franck Ravat, Olivier Teste, Ronan Tournier, Gille...
IJCGA
2002
69views more  IJCGA 2002»
15 years 16 days ago
On Deletion in Delaunay Triangulations
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
Olivier Devillers