Sciweavers

1523 search results - page 12 / 305
» The Computational Complexity of Linear Optics
Sort
View
ACL
2010
13 years 5 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz
BROADNETS
2005
IEEE
14 years 1 months ago
Network design for IP-centric light trail networks
Abstract— We explore network design principles for nextgeneration all-optical wide-area networks, employing light-trail technology. Light-trail [1] is a light-wave circuit that a...
Srivatsan Balasubramanian, Ahmed E. Kamal, Arun K....
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 7 months ago
Complexity of some Path Problems in DAGs and Linear Orders
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
Serge Burckel
ICCV
1999
IEEE
13 years 11 months ago
Multi-Frame Optical Flow Estimation using Subspace Constraints
We show that the set of all ow- elds in a sequence of frames imaging a rigid scene resides in a lowdimensional linear subspace. Based on this observation, we develop a method for ...
Michal Irani
ICALP
2009
Springer
14 years 7 months ago
The Tile Complexity of Linear Assemblies
Harish Chandran, Nikhil Gopalkrishnan, John H. Rei...