Sciweavers

619 search results - page 70 / 124
» Random Bichromatic Matchings
Sort
View
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
14 years 3 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
14 years 3 months ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß
GLOBECOM
2007
IEEE
14 years 3 months ago
Parallel Search Trie-Based Scheme for Fast IP Lookup
—As data rates in the Internet increase, the Internet Protocol (IP) address lookup is required to be resolved in shorter resolution times. IP address lookup involves finding the...
Roberto Rojas-Cessa, Lakshmi Ramesh, Ziqian Dong, ...
ATAL
2007
Springer
14 years 3 months ago
Sequential decision making in parallel two-sided economic search
This paper presents a two-sided economic search model in which agents are searching for beneficial pairwise partnerships. In each search stage, each of the agents is randomly mat...
David Sarne, Teijo Arponen
AUTOID
2005
IEEE
14 years 2 months ago
Statistical Models for Assessing the Individuality of Fingerprints
Following Daubert in 1993, forensic evidence based on fingerprints was first challenged in the 1999 case of USA vs. Byron Mitchell, and subsequently, in 20 other cases involving...
Sarat C. Dass, Yongfang Zhu, Anil K. Jain