Sciweavers

82 search results - page 8 / 17
» Connection management without retaining information
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 6 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
ASPLOS
2010
ACM
14 years 2 months ago
Flexible architectural support for fine-grain scheduling
To make efficient use of CMPs with tens to hundreds of cores, it is often necessary to exploit fine-grain parallelism. However, managing tasks of a few thousand instructions is ...
Daniel Sanchez, Richard M. Yoo, Christos Kozyrakis
SP
1989
IEEE
13 years 12 months ago
Security Issues in Policy Routing
Routing mechanisms for inter-autonomousregion communication require distribution of policy-sensitive information as well as algorithms that operate on such information. Without su...
Deborah Estrin, Gene Tsudik
EDO
2005
Springer
14 years 1 months ago
Experiences in coverage testing of a Java middleware
This paper addresses the issues of test coverage analysis of J2EE servers. These middleware are nowadays at the core of the modern information technology’s landscape. They provi...
Mehdi Kessis, Yves Ledru, Gérard Vandome
IMC
2006
ACM
14 years 1 months ago
Semi-automated discovery of application session structure
While the problem of analyzing network traffic at the granularity of individual connections has seen considerable previous work and tool development, understanding traffic at a ...
Jayanthkumar Kannan, Jaeyeon Jung, Vern Paxson, Ca...