Sciweavers

7189 search results - page 1285 / 1438
» Connecting Design with Code
Sort
View
159
Voted
DEBS
2007
ACM
15 years 5 months ago
Identification of suspicious, unknown event patterns in an event cloud
This paper describes an approach to detect unknown event patterns. In this context, an event is not only something that happens, but also something that can be analysed. This task...
Alexander Widder, Rainer von Ammon, Philippe Schae...
140
Voted
CSCW
2008
ACM
15 years 5 months ago
Social networks and context-aware spam
Social networks are popular for online communities. This paper evaluates the risk of sophisticated context-aware spam that could result from information sharing on social networks...
Garrett Brown, Travis Howe, Micheal Ihbe, Atul Pra...
149
Voted
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 5 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
138
Voted
PDSE
2000
96views more  PDSE 2000»
15 years 5 months ago
Applying Distributed Object Technology to Network Planning
The aim of this paper is to describe a generic interface through which a planning tool or design aid can be connected to a telecommunications network. In today's complex and ...
Tertius D. Wessels, Judy M. Bishop
147
Voted
USENIX
1996
15 years 5 months ago
Transparent Fault Tolerance for Parallel Applications on Networks of Workstations
This paper describes a new method for providingtransparent fault tolerance for parallel applications on a network of workstations. We have designed our method in the context of sh...
Daniel J. Scales, Monica S. Lam
« Prev « First page 1285 / 1438 Last » Next »