Sciweavers

20638 search results - page 3480 / 4128
» Network Computing
Sort
View
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
16 years 7 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
ICWS
2009
IEEE
16 years 4 months ago
A Governance Model for SOA
Currently, business requirements for rapid operational efficiency, customer responsiveness as well as rapid adaptability are driving the need for ever increasing communication and...
Pierre de Leusse, Theodosis Dimitrakos, David Bros...
WWW
2010
ACM
16 years 2 months ago
The social honeypot project: protecting online communities from spammers
We present the conceptual framework of the Social Honeypot Project for uncovering social spammers who target online communities and initial empirical results from Twitter and MySp...
Kyumin Lee, James Caverlee, Steve Webb
CAV
2009
Springer
156views Hardware» more  CAV 2009»
16 years 2 months ago
Towards Performance Prediction of Compositional Models in Industrial GALS Designs
Systems and Networks on Chips (NoCs) are a prime design focus of many hardware manufacturers. In addition to functional verification, which is a difficult necessity, the chip desi...
Nicolas Coste, Holger Hermanns, Etienne Lantreibec...
« Prev « First page 3480 / 4128 Last » Next »