10608 search results - page 671 / 2122 » Complexity of O'Hara's Algorithm |
192
Voted
PC
2000
15 years 7 months ago
2000
Rapid advancements in acoustical beamforming techniques for array signal processing are producing algorithms with increased levels of computational complexity. Concomitantly, auto...
168
Voted
IPL
2010
15 years 5 months ago
2010
We study the problem of learning parity functions that depend on at most k variables (kparities) attribute-efficiently in the mistake-bound model. We design a simple, deterministi...
199
click to vote
JDA
2010
15 years 5 months ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
198
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...
206
Voted
MICCAI
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we propose an efficient algorithm for MR image reconstruction. The algorithm minimizes a linear combination of three terms corresponding to a least square data fitti...