Sciweavers

1798 search results - page 220 / 360
» Generating presentation constraints from rhetorical structur...
Sort
View
CP
2007
Springer
16 years 18 days 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...
CVPR
2010
IEEE
16 years 2 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
ESM
2000
15 years 7 months ago
Filtered Gibbs sampler for estimating blocking probabilities in WDM optical networks
Blocking probabilities in Wavelength Division Multiplex optical networks are hard to compute for realistic sized systems, even though analytical formulas for the distribution exis...
Felisa J. Vázquez-Abad, Lachlan L. H. Andre...
CLOUDCOM
2010
Springer
15 years 4 months ago
Cost-Optimal Outsourcing of Applications into the Clouds
Abstract--Commercial services for provisioning software components and virtual infrastructure in the cloud are emerging. For customers, this creates a multitude of possibilities fo...
Immanuel Trummer, Frank Leymann, Ralph Mietzner, W...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 6 months ago
Relational-style XML query
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
Taro L. Saito, Shinichi Morishita