4488 search results - page 361 / 898 » Properties of NP-Complete Sets |
275
click to vote
OOPSLA
2000
Springer
15 years 11 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
185
click to vote
GIS
1995
ACM
15 years 11 months ago
1995
ACM
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
199
click to vote
STOC
1995
ACM
15 years 11 months ago
1995
ACM
The goal of incremental cryptography is to design cryptographic algorithms with the property that having applied the algorithm to a document, it is possible to quickly update the ...
160
click to vote
UIST
1995
ACM
15 years 11 months ago
1995
ACM
In this paper we present a new set of interactive techniques for 2D and 3D visualizations. This set of techniques is called SDM (Selective Dynamic Manipulation). Selective, indica...
212
click to vote
COCOA
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...