18090 search results - page 308 / 3618 » Computing by Only Observing |
140
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
We investigate the use of hierarchical Gaussian shortlists to speed up Gaussian likelihood computation. This approach is a combination of hierarchical Gaussian selection and stand...
145
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
174
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
182
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
A boundary sequence is a good representation of arbitrary shaped regions, but not directly used in computing shape features such as area, centroid, orientation, and so forth. In t...
175
click to vote
RECOMB
2008
Springer
16 years 6 months ago
2008
Springer
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...