Sciweavers

3946 search results - page 411 / 790
» The computational complexity of choice sets
Sort
View
INFOCOM
2005
IEEE
16 years 1 months ago
On static reachability analysis of IP networks
The primary purpose of a network is to provide reachability between applications running on end hosts. In this paper, we describe how to compute the reachability a network provide...
Geoffrey G. Xie, Jibin Zhan, David A. Maltz, Hui Z...
HIPC
2005
Springer
16 years 1 months ago
XCAT-C++: Design and Performance of a Distributed CCA Framework
In this paper we describe the design and implementation of a C++ based Common Component Architecture (CCA) framework, XCAT-C++. It can efficiently marshal and unmarshal large data...
Madhusudhan Govindaraju, Michael R. Head, Kenneth ...
GG
2004
Springer
16 years 1 months ago
Analysis of Metabolic Pathways by Graph Transformation
Biochemical pathways, such as metabolic, regulatory, and signal transduction pathways, constitute complex networks of functional and physical interactions between molecular species...
Francesc Rosselló, Gabriel Valiente
CVPR
2000
IEEE
16 years 1 days ago
Corner Guided Curve Matching and its Application to Scene Reconstruction
Corners and curves are important image features in many vision-based applications. Corners are usually more stable and easier to match than curves,while curves contain richer info...
Ying Shan, Zhengyou Zhang
COCOON
1999
Springer
15 years 12 months ago
Distributionally-Hard Languages
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
Lance Fortnow, Aduri Pavan, Alan L. Selman