Sciweavers

476 search results - page 38 / 96
» The Complexity of Equality Constraint Languages
Sort
View
CP
2007
Springer
14 years 3 months ago
Tradeoffs in the Complexity of Backdoor Detection
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
GLOBECOM
2006
IEEE
14 years 3 months ago
Distributed Multi-Cell Zero-Forcing Beamforming in Cellular Downlink Channels
Abstract— For a multiple-input single-output (MISO) downlink channel with ¢ transmit antennas, it has been recently proved that zero-forcing beamforming (ZFBF) to a subset of (a...
Oren Somekh, Osvaldo Simeone, Yeheskel Bar-Ness, A...
IJCV
2007
138views more  IJCV 2007»
13 years 8 months ago
Correspondence-free Structure from Motion
We present a novel approach for the estimation of 3D-motion directly from two images using the Radon transform. The feasibility of any camera motion is computed by integrating over...
Ameesh Makadia, Christopher Geyer, Kostas Daniilid...
EACL
2003
ACL Anthology
13 years 10 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä
PPDP
2010
Springer
13 years 7 months ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch