2356 search results - page 77 / 472 » Characterizations of postman sets |
COMBINATORICS
2007
14 years 12 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
COLING
2010
14 years 7 months ago
2010
Annotating scientific publications with keywords and phrases is of great importance to searching, indexing, and cataloging such documents. Unlike previous studies that focused on ...
TIT
2011
14 years 6 months ago
2011
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
74
Voted
EJWCN
2010
14 years 6 months ago
2010
Abstract--We consider noncooperative energy-efficient resource allocation in the interference channel. Energy-efficiency is achieved when each system pays a price proportional to i...
111
click to vote
TSP
2010
14 years 6 months ago
2010
The problem of jointly detecting multiple objects and estimating their states from image observations is formulated in a Bayesian framework by modeling the collection of states as ...