Sciweavers

3333 search results - page 318 / 667
» New Invariants for Groups
Sort
View
LICS
2002
IEEE
15 years 11 months ago
Monadic Queries over Tree-Structured Data
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
Georg Gottlob, Christoph Koch
AAECC
2001
Springer
121views Algorithms» more  AAECC 2001»
15 years 11 months ago
Algorithms for Large Integer Matrix Problems
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...
Mark Giesbrecht, Michael J. Jacobson Jr., Arne Sto...
SIGCSE
1999
ACM
123views Education» more  SIGCSE 1999»
15 years 11 months ago
Do we teach the right algorithm design techniques?
Algorithms have cometo be recognizedasthe cornerstone of computing. Surprisingly, there has been little research or discussion of general techniques for designing algorithms. Thou...
Anany Levitin
CONPAR
1992
15 years 11 months ago
Asynchronous Polycyclic Architecture
The Asynchronous Polycyclic Architecture (APA) is a new processor design for numerically intensive applications. APA resembles the VLIW architecture, in that it provides independen...
Geraldo Lino de Campos
ICIAP
2007
ACM
15 years 10 months ago
Parsing Silhouettes without Boundary Curvature
We describe a new decomposition algorithm for twodimensional, polygonal shapes. The algorithm first finds a set of overlapping ribbon-like subshapes ("ribbons") by group...
Ralf Juengling, Lakshman Prasad