11565 search results - page 115 / 2313 » Computing Minimal Mappings |
131
Voted
DCC
1993
IEEE
15 years 8 months ago
1993
IEEE
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
138
click to vote
EUROCRYPT
2000
Springer
15 years 7 months ago
2000
Springer
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
116
Voted
GD
2004
Springer
15 years 9 months ago
2004
Springer
We initiate a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic crit...
NIME
2004
Springer
15 years 9 months ago
2004
Springer
The choice of mapping strategies to effectively map controller variables to sound synthesis algorithms is examined. Specifically, we look at continuous mappings that have a geom...
121
Voted
EMMCVPR
2009
Springer
15 years 10 months ago
2009
Springer
We describe a scheme for solving Energy Minimization problems, which is based on the A∗ algorithm accomplished with appropriately chosen LP-relaxations as heuristic functions. Th...