Sciweavers

1523 search results - page 15 / 305
» The Computational Complexity of Linear Optics
Sort
View
124
Voted
ANCS
2007
ACM
15 years 7 months ago
Optimal packet scheduling in output-buffered optical switches with limited-range wavelength conversion
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
Lin Liu, Yuanyuan Yang
ECCTD
2011
108views more  ECCTD 2011»
14 years 3 months ago
Low complexity least-squares filter design for the correction of linear time-varying systems
Abstract—In this paper, a low complexity algorithm for the design of a time-varying correction filter of finite impulse response (FIR) type is presented. Using the obtained fi...
Michael Soudan, Christian Vogel
ICCV
2009
IEEE
16 years 8 months ago
Filter Flow
The filter flow problem is to compute a space-variant linear filter that transforms one image into another. This framework encompasses a broad range of transformations including...
Steven M. Seitz, Simon Baker
246
Voted
POPL
2009
ACM
16 years 4 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
ACL
2011
14 years 7 months ago
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino,...