1053 search results - page 5 / 211 » On k-Path Covers and their applications |
MMSP
2008
IEEE
14 years 3 months ago
2008
IEEE
A new chroma-based dynamic feature vector is proposed inspired by psychophysical observations that the human auditory system detects relative pitch changes rather than absolute pi...
ICCAD
1997
IEEE
14 years 1 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
WALCOM
2010
IEEE
14 years 3 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
CCCG
2007
13 years 10 months ago
2007
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...
JDA
2006
13 years 8 months ago
2006
