Sciweavers

36781 search results - page 7079 / 7357
» Parameterizing by the Number of Numbers
Sort
View
INTERNET
2007
182views more  INTERNET 2007»
15 years 6 months ago
Analysis of Caching and Replication Strategies for Web Applications
Replication and caching mechanisms are often employed to enhance the performance of Web applications. In this article, we present a qualitative and quantitative analysis of state-...
Swaminathan Sivasubramanian, Guillaume Pierre, Maa...
INTR
2007
98views more  INTR 2007»
15 years 6 months ago
User-centered evaluation of information: a research challenge
Purpose – This paper sets out to present the concept of the value of information, review the descriptive, rational, social and behavioral approaches for assessing the value of i...
Daphne R. Raban
TCS
2008
15 years 6 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
TCS
2008
15 years 6 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
IPL
2007
72views more  IPL 2007»
15 years 6 months ago
How to safely close a discussion
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
Gildas Avoine, Serge Vaudenay
« Prev « First page 7079 / 7357 Last » Next »