4926 search results - page 495 / 986 » Two Graph Algorithms On an Associative Computing Model |
152
click to vote
CPHYSICS
2011
14 years 7 months ago
2011
The inner silicon detector of the Compact Muon Solenoid experiment (CMS) at CERN’s LHC consists of 16 588 modules. Charged-particle tracks in the detector are used to improve th...
140
click to vote
CSDA
2006
15 years 3 months ago
2006
TheexactlikelihoodfunctionofaGaussianvectorautoregressive-movingaverage(VARMA)model is evaluated in two nonstandard cases: (a) a parsimonious structured form, such as obtained in ...
129
click to vote
EUROCOLT
1995
Springer
15 years 7 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
135
click to vote
ICDCS
2009
IEEE
16 years 27 days ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
117
click to vote
ACCV
2009
Springer
15 years 10 months ago
2009
Springer
We propose a novel efficient algorithm for robust tracking of a fixed number of targets in real-time with low failure rate. The method is an instance of Sequential Importance Resa...