Sciweavers

10792 search results - page 246 / 2159
» An Evaluation of Non-Equijoin Algorithms
Sort
View
CGF
2010
146views more  CGF 2010»
15 years 6 months ago
Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...
Marcel Campen, Leif Kobbelt
TCOM
2008
98views more  TCOM 2008»
15 years 6 months ago
Performance evaluation of multi-hop CSMA/CA networks in fading environments
The performance of multi-hop CSMA/CA networks has in most cases been evaluated via simulations, or analytically using a perfect collision channel model. Using such methods, one ca...
Duong A. Hoang, Ronald A. Iltis
COLING
2002
15 years 6 months ago
A Cheap and Fast Way to Build Useful Translation Lexicons
The paper presents a statistical approach to automatic building of translation lexicons from parallel corpora. We briefly describe the pre-processing steps, a baseline iterative m...
Dan Tufis
CORR
1999
Springer
111views Education» more  CORR 1999»
15 years 6 months ago
On Bounded-Weight Error-Correcting Codes
: This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to th...
Russell Bent, Michael Schear, Lane A. Hemaspaandra...
ACL
2010
15 years 4 months ago
Computing Weakest Readings
We present an efficient algorithm for computing the weakest readings of semantically ambiguous sentences. A corpus-based evaluation with a large-scale grammar shows that our algor...
Alexander Koller, Stefan Thater