Sciweavers

3145 search results - page 335 / 629
» Algebraic Linear Orderings
Sort
View
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 6 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
MLG
2007
Springer
16 years 22 days ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
FCCM
2006
IEEE
195views VLSI» more  FCCM 2006»
16 years 20 days ago
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
Andrey Bogdanov, M. C. Mertens
SI3D
2005
ACM
16 years 5 days ago
Reducing blendshape interference by selected motion attenuation
Blendshapes (linear shape interpolation models) are perhaps the most commonly employed technique in facial animation practice. A major problem in creating blendshape animation is ...
John P. Lewis, Jonathan Mooser, Zhigang Deng, Ulri...
SPAA
2004
ACM
16 years 1 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter