Sciweavers

28888 search results - page 22 / 5778
» Computability and complexity in analysis
Sort
View
TOG
2010
129views more  TOG 2010»
13 years 2 months ago
Optical computing for fast light transport analysis
We present a general framework for analyzing the transport matrix of a real-world scene at full resolution, without capturing many photos. The key idea is to use projectors and ca...
Matthew O'Toole, Kiriakos N. Kutulakos
RECOMB
2008
Springer
14 years 8 months ago
Reconstructing the Evolutionary History of Complex Human Gene Clusters
Abstract. Clusters of genes that evolved from single progenitors via repeated segmental duplications present significant challenges to the generation of a truly complete human geno...
Adam C. Siepel, Eric D. Green, Giltae Song, Tom&aa...
PODC
2010
ACM
13 years 11 months ago
Brief announcement: complexity and solution of the send-receive correlation problem
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
Benito van der Zander, Egon Wanke, Wolfgang Kie&sz...
TSP
2008
174views more  TSP 2008»
13 years 7 months ago
Complex ICA Using Nonlinear Functions
We introduce a framework based on Wirtinger calculus for nonlinear complex-valued signal processing such that all computations can be directly carried out in the complex domain. Th...
Tülay Adali, Hualiang Li, Mike Novey, J.-F. C...
FOCS
1990
IEEE
13 years 12 months ago
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
Brigitte Vallée, Philippe Flajolet