ACCV
2006
Springer
13 years 10 months ago
2006
Springer
Construction of key poses is one of the most tedious and time consuming steps in synthesizing of 3D virtual actors. Recent alternate schemes expect the user to specify two inputs. ...
ISCAS
2006
IEEE
13 years 10 months ago
2006
IEEE
— All-solution Boolean satisfiability (SAT) solvers are engines employed to find all the possible solutions to a SAT problem. Their applications are found throughout the EDA in...
IPPS
2006
IEEE
13 years 10 months ago
2006
IEEE
In this paper we present a game theoretic approach to solve the static load balancing problem in a distributed system which consists of heterogeneous computers connected by a sing...
ACSAC
2006
IEEE
13 years 10 months ago
2006
IEEE
Address-space randomization (ASR) is a promising solution to defend against memory corruption attacks that have contributed to about three-quarters of USCERT advisories in the pas...
ICCBR
2007
Springer
13 years 10 months ago
2007
Springer
Case-Based Reasoning (CBR) is a methodology that reuses the solutions of previous similar problems to solve new problems. Adaptation is the most difficult stage in the CBR cycle, e...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
It is not surprising that there is strong interest in kNN queries to enable clustering, classification and outlierdetection tasks. However, previous approaches to privacypreservi...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper describes a DfT solution for modern seriallink transceivers. We first summarize the architectures of the Crosstalk Canceller and the Equalizer used in advanced transcei...
ICSM
2008
IEEE
13 years 11 months ago
2008
IEEE
Annotations are often mentioned as a potential alternative to tackle the fragile nature of AspectJ pointcuts. However, annotations themselves can be considered crosscutting elemen...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
We consider the problem of planar object registration on binary images where the aligning transformation is restricted to the group of affine transformations. Previous approaches...
CISS
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— Costas array enumeration is an NP-complete problem with a highly parallelize-able solution. This paper examines the implementation of a solution to this problem on an F...