Sciweavers

186 search results - page 36 / 38
» Tractability of Theory Patching
Sort
View
AAAI
2007
15 years 19 days ago
On the Prospects for Building a Working Model of the Visual Cortex
Human visual capability has remained largely beyond the reach of engineered systems despite intensive study and considerable progress in problem understanding, algorithms and comp...
Thomas Dean, Glenn Carroll, Richard Washington
ACS
2007
14 years 10 months ago
Components of the Fundamental Category II
In this article we carry on the study of the fundamental category (Goubault and Raussen, 2002; Goubault, 2003) of a partially ordered topological space (Nachbin, 1965; Johnstone, 1...
Eric Goubault, Emmanuel Haucourt
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 10 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
CORR
2010
Springer
204views Education» more  CORR 2010»
14 years 10 months ago
Optimization Framework and Graph-Based Approach for Relay-Assisted Bidirectional OFDMA Cellular Networks
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...
Yuan Liu, Meixia Tao, Bin Li, Hui Shen
JACM
2006
99views more  JACM 2006»
14 years 10 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller