Sciweavers

3637 search results - page 329 / 728
» On Dynamic Bit-Probe Complexity
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
PERCOM
2004
ACM
16 years 6 months ago
Programming Pervasive and Mobile Computing Applications with the TOTA Middleware
Pervasive computing calls for suitable middleware and programming models to deal with large software systems dived in dynamic mobile network environments. Here we present the prog...
Marco Mamei, Franco Zambonelli
CCS
2009
ACM
16 years 1 months ago
Mixed-initiative security agents
Security decision-making is hard for both humans and machines. This is because security decisions are context-dependent, require highly dynamic, specialized knowledge, and require...
Rachel Greenstadt, Sadia Afroz, Michael Brennan
ICSE
2009
IEEE-ACM
16 years 1 months ago
DYVISE: Performance analysis of production systems research demonstration
Many of today’s complex systems are multithreaded servers that effectively run forever and need to work under varying loads and environments. Understanding the behavior of such ...
Steven P. Reiss
COMPLEX
2009
Springer
16 years 1 months ago
Synchronization Stability of Coupled Near-Identical Oscillator Network
We derive variational equations to analyze the stability of synchronization for coupled near-identical oscillators. To study the effect of parameter mismatch on the stability in a ...
Jie Sun, Erik M. Bollt, Takashi Nishikawa