Sciweavers

4302 search results - page 308 / 861
» Index Pairs Algorithms
Sort
View
COLING
2002
15 years 4 months ago
Unsupervised Word Sense Disambiguation Using Bilingual Comparable Corpora
An unsupervised method for word sense disambiguation using a bilingual comparable corpus was developed. First, it extracts statistically significant pairs of related words from th...
Hiroyuki Kaji, Yasutsugu Morimoto
NETWORKS
2010
15 years 2 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
SEMWEB
2010
Springer
15 years 2 months ago
Using SPARQL to Test for Lattices: Application to Quality Assurance in Biomedical Ontologies
We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is ...
Guo-Qiang Zhang, Olivier Bodenreider
TIT
2011
141views more  TIT 2011»
14 years 11 months ago
Near-Complementary Sequences With Low PMEPR for Peak Power Control in Multicarrier Communications
New families of near-complementary sequences are presented for peak power control in multicarrier communications. A framework for near-complementary sequences is given by the expl...
Nam Yul Yu, Guang Gong
AAAI
2011
14 years 4 months ago
Cross-Language Latent Relational Search: Mapping Knowledge across Languages
Latent relational search (LRS) is a novel approach for mapping knowledge across two domains. Given a source domain knowledge concerning the Moon, “The Moon is a satellite of the...
Nguyen Tuan Duc, Danushka Bollegala, Mitsuru Ishiz...