Sciweavers

2218 search results - page 203 / 444
» Testing Expressibility Is Hard
Sort
View
PVLDB
2008
123views more  PVLDB 2008»
13 years 10 months ago
Dependable cardinality forecasts for XQuery
Though inevitable for effective cost-based query rewriting, the derivation of meaningful cardinality estimates has remained a notoriously hard problem in the context of XQuery. By...
Jens Teubner, Torsten Grust, Sebastian Maneth, She...
CPAIOR
2010
Springer
13 years 9 months ago
Boosting Set Constraint Propagation for Network Design
Abstract. This paper reconsiders the deployment of synchronous optical networks (SONET), an optimization problem naturally expressed in terms of set variables. Earlier approaches, ...
Justin Yip, Pascal Van Hentenryck, Carmen Gervet
IBPRIA
2011
Springer
13 years 2 months ago
The Fast and the Flexible: Extended Pseudo Two-Dimensional Warping for Face Recognition
Abstract. In this work, we propose a novel extension of pseudo 2D image warping (P2DW) which allows for joint alignment and recognition of non-rectified face images. P2DW allows f...
Leonid Pishchulin, Tobias Gass, Philippe Dreuw, He...
ICCV
2011
IEEE
12 years 10 months ago
Probabilistic Group-Level Motion Analysis and Scenario Recognition
This paper addresses the challenge of recognizing behavior of groups of individuals in unconstraint surveillance environments. As opposed to approaches that rely on agglomerative ...
Ming-Ching Chang, Nils Krahnstoever, Weina Ge
ESOP
2012
Springer
12 years 6 months ago
Multiparty Session Types Meet Communicating Automata
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
Pierre-Malo Deniélou, Nobuko Yoshida