Sciweavers

2063 search results - page 51 / 413
» connection 2007
Sort
View
CN
2007
141views more  CN 2007»
14 years 10 months ago
Designing an overload control strategy for secure e-commerce applications
Uncontrolled overload can lead e-commerce applications to considerable revenue losses. For this reason, overload prevention in these applications is a critical issue. In this pape...
Jordi Guitart, David Carrera, Vicenç Beltra...
DEXA
2007
Springer
76views Database» more  DEXA 2007»
15 years 4 months ago
Using an Object Reference Approach to Distributed Updates
With the Object-Reference (ORef) approach, the traditional object-oriented model is extended with references to act as a canonical model. Our ORef model facilitates the storage of ...
Dalen Kambur, Mark Roantree, John Murphy
CORR
2007
Springer
181views Education» more  CORR 2007»
14 years 10 months ago
A new lower bound on the independence number of a graph
For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence numbe...
Ossama Kettani
ATC
2007
Springer
15 years 4 months ago
Stepping-Stone Detection Via Request-Response Traffic Analysis
Abstract. In this paper, we develop an algorithm that may be used as a stepping-stone detection tool. Our approach is based on analyzing correlations between the cumulative number ...
Shou-Hsuan Stephen Huang, Robert Lychev, Jianhua Y...
JCT
2007
83views more  JCT 2007»
14 years 10 months ago
On the largest eigenvalue of non-regular graphs
We study the spectral radius of connected non-regular graphs. Let λ1(n,Δ) be the maximum spectral radius among all connected non-regular graphs with n vertices and maximum degre...
Bolian Liu, Jian Shen, Xinmao Wang