458 search results - page 49 / 92 » Distance graphs: from random geometric graphs to Bernoulli g... |
NAACL
2010
13 years 6 months ago
2010
We present a random-walk-based approach to learning paraphrases from bilingual parallel corpora. The corpora are represented as a graph in which a node corresponds to a phrase, an...
DIALM
2005
ACM
13 years 10 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
ICSE
2008
IEEE-ACM
14 years 8 months ago
2008
IEEE-ACM
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
METRICS
2005
IEEE
14 years 2 months ago
2005
IEEE
Software architecture is an important form of abstraction, representing the overall system structure and the relationship among components. When software is modified from one ver...
ECCC
2008
13 years 8 months ago
2008
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...