1871 search results - page 126 / 375 » The Ephemeral Pairing Problem |
INFOCOM
2007
IEEE
15 years 5 months ago
2007
IEEE
Abstract— In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and...
MFCS
2007
Springer
15 years 5 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
MLCW
2005
Springer
15 years 5 months ago
2005
Springer
Textual Entailment recognition is a very difficult task as it is one of the fundamental problems in any semantic theory of natural language. As in many other NLP tasks, Machine Lea...
ICA
2004
Springer
15 years 4 months ago
2004
Springer
This paper presents a method for solving the permutation problem of frequency domain blind source separation (BSS) when the number of source signals is large, and the potential sou...
ICRA
2003
IEEE
15 years 4 months ago
2003
IEEE
We introduce the Marco Polo Localization approach, where we apply sound as a tool for gathering range measurements between robots, and use those to solve a range-only Simultaneous...