Sciweavers

2124 search results - page 317 / 425
» Aggregating time partitions
Sort
View
ACMSE
2010
ACM
15 years 2 months ago
Adaptive stable marriage algorithms
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...
John Dabney, Brian C. Dean
147
Voted
IMC
2010
ACM
15 years 2 months ago
On the characteristics and reasons of long-lived internet flows
Prior studies of Internet traffic have considered traffic at different resolutions and time scales: packets and flows for hours or days, aggregate packet statistics for days or we...
Lin Quan, John Heidemann
SPAA
2009
ACM
16 years 5 months ago
Classifying peer-to-peer network coding schemes
Modern peer-to-peer file sharing systems distribute large files among peers using block partitioning. Blocks can be redistributed by a peer even before the whole file is available...
Christian Ortolf, Christian Schindelhauer, Arne Va...
156
Voted
VLSID
2008
IEEE
138views VLSI» more  VLSID 2008»
16 years 5 months ago
Memory Architecture Exploration Framework for Cache Based Embedded SOC
Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and l...
T. S. Rajesh Kumar, C. P. Ravikumar, R. Govindaraj...
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
16 years 2 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy