Sciweavers

59 search results - page 11 / 12
» Generating all polynomial invariants in simple loops
Sort
View
PLDI
2006
ACM
14 years 1 months ago
Practical dynamic software updating for C
Software updates typically require stopping and restarting an application, but many systems cannot afford to halt service, or would prefer not to. Dynamic software updating (DSU) ...
Iulian Neamtiu, Michael W. Hicks, Gareth Stoyle, M...
CGO
2010
IEEE
14 years 2 months ago
Automatic creation of tile size selection models
Tiling is a widely used loop transformation for exposing/exploiting parallelism and data locality. Effective use of tiling requires selection and tuning of the tile sizes. This is...
Tomofumi Yuki, Lakshminarayanan Renganarayanan, Sa...
ALMOB
2006
89views more  ALMOB 2006»
13 years 7 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
IVA
2005
Springer
14 years 28 days ago
A Platform Independent Architecture for Virtual Characters and Avatars
this is via the ”Motion Abstraction”. This is a single abstraction that represents any type of animation of a character. Different implementations of the ion can provide very ...
M. Gillies, Vinoba Vinayagamoorthy, D. Robeterson,...
CVPR
2004
IEEE
14 years 9 months ago
Linear Model Hashing and Batch RANSAC for Rapid and Accurate Object Recognition
This paper proposes a joint feature-based model indexing and geometric constraint based alignment pipeline for efficient and accurate recognition of 3D objects from a large model ...
Ying Shan, Bogdan Matei, Harpreet S. Sawhney, Rake...