Sciweavers

2136 search results - page 372 / 428
» Improving on Expectation Propagation
Sort
View
SPAA
2004
ACM
14 years 3 months ago
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper pr...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert...
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 3 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
DAS
2010
Springer
14 years 2 months ago
Analysis of whole-book recognition
Whole-book recognition is a document image analysis strategy that operates on the complete set of a book’s page images, attempting to improve accuracy by automatic unsupervised ...
Pingping Xiu, Henry S. Baird
VLDB
1998
ACM
101views Database» more  VLDB 1998»
14 years 2 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
SIGMETRICS
1997
ACM
111views Hardware» more  SIGMETRICS 1997»
14 years 2 months ago
Cache Behavior of Network Protocols
In this paper we present a performance study of memory reference behavior in network protocol processing, using an Internet-based protocol stack implemented in the x-kernel runnin...
Erich M. Nahum, David J. Yates, James F. Kurose, D...