4212 search results - page 81 / 843 » On Compressible Pairings and Their Computation |
ENTCS
2008
15 years 5 days ago
2008
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
84
Voted
DCC
2000
IEEE
15 years 5 months ago
2000
IEEE
Applications in scientific computing operate with high-volume numerical data and the occupied space should be reduced. Traditional compression algorithms cannot provide sufficie...
115
click to vote
IMC
2010
ACM
14 years 10 months ago
2010
ACM
Loss-pair measurement was proposed a decade ago for discovering network path properties, such as a router's buffer size. A packet pair is regarded as a loss pair if exactly o...
131
Voted
ACL
2012
13 years 3 months ago
2012
In this paper, we propose a web-based bilingual concordancer, DOMCAT 1 , for domain-specific computer assisted translation. Given a multi-word expression as a query, the system in...
123
Voted
IWOCA
2010
Springer
14 years 7 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...