Sciweavers

1085 search results - page 120 / 217
» On the performance of one-to-many data transformations
Sort
View
IJON
2008
116views more  IJON 2008»
13 years 9 months ago
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
Paul D. O'Grady, Barak A. Pearlmutter
OOPSLA
1999
Springer
14 years 1 months ago
Removing Unnecessary Synchronization in Java
Java programs perform many synchronization operations on data structures. Some of these synchronizations are unnecessary; in particular, if an object is reachable only by a single ...
Jeff Bogda, Urs Hölzle
CAV
2009
Springer
165views Hardware» more  CAV 2009»
14 years 1 months ago
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
Sven Verdoolaege, Gerda Janssens, Maurice Bruynoog...
TSMC
2008
198views more  TSMC 2008»
13 years 9 months ago
Representation Plurality and Fusion for 3-D Face Recognition
In this paper, we present an extensive study of 3-D face recognition algorithms and examine the benefits of various score-, rank-, and decision-level fusion rules. We investigate f...
Berk Gökberk, Helin Dutagaci, A. Ulas, Lale A...
DRM
2003
Springer
14 years 2 months ago
Obfuscation of design intent in object-oriented applications
Protection of digital data from unauthorized access is of paramount importance. In the past several years, much research has concentrated on protecting data from the standpoint of...
Mikhail Sosonkin, Gleb Naumovich, Nasir D. Memon