2168 search results - page 266 / 434 » Randomized Algorithms and Complexity Theory |
153
click to vote
SIGMETRICS
2008
ACM
15 years 3 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
138
click to vote
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
112
click to vote
STOC
2001
ACM
16 years 3 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
137
Voted
MM
2004
ACM
15 years 9 months ago
2004
ACM
A novel solution to the reliable multicast problem is the “digital fountain” approach, in which data is encoded with an erasure protection code before transmission, and receiv...
148
Voted
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
A novel feature extraction method, namely monogenic binary pattern (MBP), is proposed in this paper based on the theory of monogenic signal analysis, and the histogram of MBP (HMB...