Sciweavers

881 search results - page 134 / 177
» connection 2004
Sort
View
FDL
2004
IEEE
15 years 1 months ago
A Formal Verification Approach for IP-based Designs
This paper proposes a formal verification methodology which is smoothly integrated with component-based system-level design, using a divide and conquer approach. The methodology a...
Daniel Karlsson, Petru Eles, Zebo Peng
FOCS
2004
IEEE
15 years 1 months ago
Edge-Disjoint Paths in Planar Graphs
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
FTDCS
2004
IEEE
15 years 1 months ago
A New Perspective in Defending against DDoS
Distributed denial of service (DDoS) is a major threat to the availability of Internet services. The anonymity allowed by IP networking, together with the distributed, large scale...
Shigang Chen, Randy Chow
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
COLING
2008
14 years 11 months ago
Exploiting Constituent Dependencies for Tree Kernel-Based Semantic Relation Extraction
This paper proposes a new approach to dynamically determine the tree span for tree kernel-based semantic relation extraction. It exploits constituent dependencies to keep the node...
Longhua Qian, Guodong Zhou, Fang Kong, Qiaoming Zh...