3702 search results - page 604 / 741 » All Pairings Are in a Group |
164
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
162
click to vote
ICB
2009
Springer
16 years 1 months ago
2009
Springer
Law enforcement agencies routinely collect both rolled and plain fingerprints of all the ten fingers of suspects. These two types of fingerprints complement each other, since ro...
163
click to vote
IFIP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
179
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
192
click to vote
ISSTA
2009
ACM
16 years 1 months ago
2009
ACM
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...