Sciweavers

1525 search results - page 195 / 305
» Matching with Regular Constraints
Sort
View
ENTCS
2008
120views more  ENTCS 2008»
15 years 4 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier
128
Voted
IANDC
2010
115views more  IANDC 2010»
15 years 1 months ago
18th International Conference on Concurrency Theory
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
Luís Caires, Vasco Thudichum Vasconcelos
176
Voted
WINET
2011
14 years 11 months ago
Aggregation convergecast scheduling in wireless sensor networks
Abstract—We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommo...
Baljeet Malhotra, Ioanis Nikolaidis, Mario A. Nasc...
JMLR
2010
119views more  JMLR 2010»
14 years 11 months ago
Factorized Orthogonal Latent Spaces
Existing approaches to multi-view learning are particularly effective when the views are either independent (i.e, multi-kernel approaches) or fully dependent (i.e., shared latent ...
Mathieu Salzmann, Carl Henrik Ek, Raquel Urtasun, ...
146
Voted
TOG
2012
161views Communications» more  TOG 2012»
13 years 7 months ago
Single-view hair modeling for portrait manipulation
Human hair is known to be very difficult to model or reconstruct. In this paper, we focus on applications related to portrait manipulation and take an application-driven approach...
Menglei Chai, Lvdi Wang, Yanlin Weng, Yizhou Yu, B...