16504 search results - page 218 / 3301 » New Problems, New Solutions |
187
click to vote
GRAMMARS
2000
15 years 6 months ago
2000
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the ...
153
click to vote
ECCC
1998
15 years 6 months ago
1998
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
153
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— The main aspect in multi-robot exploration is the efficient coordination of a group of robots. Inspired by previous results on the coverage problem, we propose a novel, fronti...
199
click to vote
IJNSEC
2010
15 years 1 months ago
2010
Remote user authentication scheme is one of the simplest and the most convenient authentication mechanisms to deal with secret data over insecure networks. These types of schemes ...
151
click to vote
JCO
2010
15 years 5 months ago
2010
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...