2512 search results - page 346 / 503 » Learning from Highly Structured Data by Decomposition |
CAI
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
NAA
2004
Springer
15 years 3 months ago
2004
Springer
It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D or 3D elliptic prob...
ISCAS
2003
IEEE
15 years 3 months ago
2003
IEEE
The discrete multitone (DMT)transceivers have enjoyed great success in high speed data transmission. It is known that when the cyclicprefix is no shorterthan the channel impulse r...
VL
1995
IEEE
15 years 1 months ago
1995
IEEE
After more than a decade of research, visual languages have still not become everyday programming tools. On a short term, an integration of visual languages with well-established ...
122
click to vote
COMGEO
1999
ACM
14 years 9 months ago
1999
ACM
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...