Sciweavers

417 search results - page 18 / 84
» Performance Analysis of Three Text-Join Algorithms
Sort
View
CPM
2006
Springer
140views Combinatorics» more  CPM 2006»
15 years 1 months ago
Identifying Co-referential Names Across Large Corpora
A single logical entity can be referred to by several different names over a large text corpus. We present our algorithm for finding all suchco-reference sets in a large corpus. Ou...
Levon Lloyd, Andrew Mehler, Steven Skiena
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
15 years 1 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
MST
2006
136views more  MST 2006»
14 years 9 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
DAS
2006
Springer
15 years 1 months ago
Structural Analysis of Mathematical Formulae with Verification Based on Formula Description Grammar
In this paper, a reliable and efficient structural analysis method for mathematical formulae is proposed for practical mathematical OCR. The proposed method consists of three steps...
Seiichi Toyota, Seiichi Uchida, Masakazu Suzuki
RTAS
1998
IEEE
15 years 1 months ago
Bounding Loop Iterations for Timing Analysis
Static timing analyzers need to know the minimum and maximum number of iterations associated with each loop in a real-time program so accurate timing predictions can be obtained. ...
Christopher A. Healy, Mikael Sjödin, Viresh R...