11565 search results - page 371 / 2313 » Computing Minimal Mappings |
180
Voted
CAV
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
170
Voted
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
173
Voted
DEXA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping ...
172
click to vote
ICCNMC
2005
Springer
16 years 11 days ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
302
click to vote
ACSE
2000
ACM
15 years 11 months ago
2000
ACM
Although testing accounts for 50% of the cost of software, it receives little treatment in most curricula. This paper presents some approaches to giving all students multiple, inc...