Sciweavers

17760 search results - page 3533 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
GROUP
2010
ACM
13 years 5 months ago
Design, implementation, and evaluation of an approach for determining when programmers are having difficulty
Previous research has motivated the idea of automatically determining when programmers are having difficulty, provided an initial algorithm (unimplemented in an actual system), an...
Jason Carter, Prasun Dewan
ICDM
2010
IEEE
201views Data Mining» more  ICDM 2010»
13 years 5 months ago
Mining Closed Strict Episodes
Discovering patterns in a sequence is an important aspect of data mining. One popular choice of such patterns are episodes, patterns in sequential data describing events that often...
Nikolaj Tatti, Boris Cule
IMC
2010
ACM
13 years 5 months ago
Revisiting the case for a minimalist approach for network flow monitoring
Network management applications require accurate estimates of a wide range of flow-level traffic metrics. Given the inadequacy of current packet-sampling-based solutions, several ...
Vyas Sekar, Michael K. Reiter, Hui Zhang
IMC
2010
ACM
13 years 5 months ago
The effect of packet loss on redundancy elimination in cellular wireless networks
Network-level redundancy elimination (RE) algorithms reduce traffic volume on bandwidth-constrained network paths by avoiding the transmission of repeated byte sequences. Previous...
Cristian Lumezanu, Katherine Guo, Neil Spring, Bob...
IPPS
2010
IEEE
13 years 5 months ago
Optimization of linked list prefix computations on multithreaded GPUs using CUDA
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
Zheng Wei, Joseph JáJá
« Prev « First page 3533 / 3552 Last » Next »