5100 search results - page 679 / 1020 » The Linear Complexity of a Graph |
180
click to vote
CORR
2009
Springer
15 years 4 months ago
2009
Springer
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
196
click to vote
EMNLP
2010
15 years 4 months ago
2010
We present a novel approach to relation extraction that integrates information across documents, performs global inference and requires no labelled text. In particular, we tackle ...
183
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
We examine distributed time-synchronization in mobile ad-hoc and sensor networks. The problem is to estimate the skews and offsets of clocks of all the nodes with respect to an arb...
170
click to vote
JMLR
2010
15 years 1 months ago
2010
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
204
click to vote
SIAMDM
2010
15 years 1 months ago
2010
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...