Sciweavers

173 search results - page 27 / 35
» random 1999
Sort
View
FOCS
2008
IEEE
14 years 4 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
GFKL
2007
Springer
123views Data Mining» more  GFKL 2007»
14 years 4 months ago
Projecting Dialect Distances to Geography: Bootstrap Clustering vs. Noisy Clustering
Abstract. Dialectometry produces aggregate distance matrices in which a distance is specified for each pair of sites. By projecting groups obtained by clustering onto geography on...
John Nerbonne, Peter Kleiweg, Wilbert Heeringa, Fr...
AUTOID
2005
IEEE
14 years 3 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
LCN
2005
IEEE
14 years 3 months ago
On the Server Fairness of Congestion Control in the ISP Edge Router
The Internet Engineering Task Force (IETF) recommended the deployment of Active Queue Management (AQM) in the Internet routers in 1998. There were more than 50 new AQM algorithms ...
Hsien-Ming Wu, Chin-Chi Wu, Woei Lin
COMPSAC
1999
IEEE
14 years 2 months ago
Testing Extensible Design Patterns in Object-Oriented Frameworks through Scenario Templates
Design patterns have been used in object-oriented frameworks such as the IBM San Francisco framework, Apple's Rhaspody, OpenStep, and WebObjects, and DIWB. However, few guide...
Wei-Tek Tsai, Yongzhong Tu, Weiguang Shao, Ezra Eb...