Sciweavers

14850 search results - page 2791 / 2970
» A Geometric Approach to Betweenness
Sort
View
SMALLTALK
2007
Springer
15 years 10 months ago
Transactional memory for smalltalk
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
Lukas Renggli, Oscar Nierstrasz
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
15 years 10 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan
GLOBECOM
2006
IEEE
15 years 10 months ago
AS Path Inference by Exploiting Known AS Paths
Abstract— Inferring AS-level end-to-end paths can be a valuable tool for both network operators and researchers. A widely known technique for inferring end-to-end paths is to per...
Jian Qiu, Lixin Gao
ICDE
2006
IEEE
159views Database» more  ICDE 2006»
15 years 10 months ago
Replication Based on Objects Load under a Content Distribution Network
Users tend to use the Internet for “resource-hungry” applications (which involve content such as video, audio on-demand and distributed data) and at the same time, more and mo...
George Pallis, Konstantinos Stamos, Athena Vakali,...
ICPR
2006
IEEE
15 years 10 months ago
Fast Linear Discriminant Analysis Using Binary Bases
Linear Discriminant Analysis (LDA) is a widely used technique for pattern classification. It seeks the linear projection of the data to a low dimensional subspace where the data ...
Feng Tang, Hai Tao
« Prev « First page 2791 / 2970 Last » Next »