895 search results - page 106 / 179 » Using graphs for some discrete tomography problems |
101
click to vote
ICST
2010
IEEE
14 years 8 months ago
2010
IEEE
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
3DIM
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we present a new algorithm to reconstruct 3D surfaces from an unorganized point cloud based on generalizing the MPU implicit algorithm through introducing a powerfu...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
Automatic design of software architecture by use of genetic algorithms has already been shown to be feasible. A natural problem is to augment – if not replace – genetic algori...
107
click to vote
CANS
2011
Springer
13 years 10 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...