Sciweavers

1484 search results - page 156 / 297
» Ants meeting algorithms
Sort
View
WEBI
2009
Springer
15 years 4 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova
98
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
Time Dependent Message Spraying for Routing in Intermittently Connected Networks
—Intermittently connected mobile networks, also called Delay Tolerant Networks (DTNs), are wireless networks in which at any given time instance, the probability of having a comp...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski
ICIP
2008
IEEE
15 years 4 months ago
Buffer constrained rate control for low bitrate dual-frame video coding
In dual-frame video coding, one long-term reference (LTR) and one short-term reference (STR) frames are used for motion estimation and compensation. In previous work, it was shown...
Mayank Tiwari, Theodore Groves, Pamela C. Cosman
NOMS
2008
IEEE
15 years 4 months ago
Towards SLA-based optimal workload distribution in SANs
—Storage Area Networks (SANs) connect storage devices to servers over fast network interconnects. We consider the problem of optimal SAN configuration with the goal of meeting s...
Eray Gencay, Carsten Sinz, Wolfgang Küchlin
95
Voted
ICDCS
2006
IEEE
15 years 4 months ago
Adaptive Control of Extreme-scale Stream Processing Systems
Abstract— Distributed stream processing systems offer a highly scalable and dynamically configurable platform for time-critical applications ranging from real-time, exploratory ...
Lisa Amini, Navendu Jain, Anshul Sehgal, Jeremy Si...