Sciweavers

4488 search results - page 268 / 898
» Properties of NP-Complete Sets
Sort
View
ADCM
2008
112views more  ADCM 2008»
15 years 7 months ago
Frames in spaces with finite rate of innovation
Abstract. Signals with finite rate of innovation are those signals having finite degrees of freedom per unit of time that specify them. In this paper, we introduce a prototypical s...
Qiyu Sun
182
Voted
CCR
2006
81views more  CCR 2006»
15 years 6 months ago
LTCP: improving the performance of TCP in highspeed networks
In this paper, we propose Layered TCP (LTCP for short), a set of simple modifications to the congestion window response of TCP to make it more scalable in highspeed networks. LTCP...
Sumitha Bhandarkar, Saurabh Jain, A. L. Narasimha ...
IJSI
2008
109views more  IJSI 2008»
15 years 6 months ago
Modular Church-Rosser Modulo: The Complete Picture
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
Jean-Pierre Jouannaud, Yoshihito Toyama
JCP
2006
102views more  JCP 2006»
15 years 6 months ago
General Methodology for Analysis and Modeling of Trust Relationships in Distributed Computing
In this paper, we discuss a general methodology for analysis and modeling of trust relationships in distributed computing. We discuss the classification of trust relationships, cat...
Weiliang Zhao, Vijay Varadharajan, George Bryan
JCT
2006
89views more  JCT 2006»
15 years 6 months ago
Revlex-initial 0/1-polytopes
We introduce revlex-initial 0/1-polytopes as the convex hulls of reverse-lexicographically initial sets of 0/1-vectors. Thus for each n 2d , we consider the 0/1-knapsack polytope ...
Rafael Gillmann, Volker Kaibel