Sciweavers

2107 search results - page 131 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ISCA
2007
IEEE
94views Hardware» more  ISCA 2007»
15 years 3 months ago
Tailoring quantum architectures to implementation style: a quantum computer for mobile and persistent qubits
In recent years, quantum computing (QC) research has moved from the realm of theoretical physics and mathematics into real implementations [9]. With many different potential hardw...
Eric Chi, Stephen A. Lyon, Margaret Martonosi
119
Voted
MICAI
2004
Springer
15 years 9 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
CASES
2004
ACM
15 years 9 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
WISA
2007
Springer
15 years 9 months ago
Detecting Motifs in System Call Sequences
The search for patterns or motifs in data represents an area of key interest to many researchers. In this paper we present the Motif Tracking Algorithm, a novel immune inspired pat...
William O. Wilson, Jan Feyereisl, Uwe Aickelin
116
Voted
CG
2004
Springer
15 years 3 months ago
Compression of soft-body animation sequences
We describe a compression scheme for the geometry component of 3D animation sequences. This scheme is based on the principle component analysis (PCA) method, which represents the ...
Zachi Karni, Craig Gotsman