Sciweavers

608 search results - page 40 / 122
» Random Systems with Complete Connections
Sort
View
ICDE
2009
IEEE
160views Database» more  ICDE 2009»
15 years 11 months ago
MatchUp: Autocompletion for Mashups
A mashup is a Web application that integrates data, computation and GUI provided by several systems into a unique tool. The concept originated from the understanding that the numbe...
Serge Abiteboul, Ohad Greenshpan, Tova Milo, Neokl...
SIGMETRICS
2005
ACM
15 years 3 months ago
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
Derek Leonard, Vivek Rai, Dmitri Loguinov
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
14 years 11 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
15 years 10 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
CSREASAM
2010
14 years 7 months ago
Traffic Management and Security Based on Priority Queueing and Multicore Firewall Implementation
We consider the telematics appliances, such as firewall, as a basic part of security system with specific preemptive priority queuing and access control algorithm oriented on multi...
Vladimir S. Zaborovsky, Vladimir Mulukha, Sergey K...