Sciweavers

2654 search results - page 355 / 531
» On Pairing Inversion Problems
Sort
View
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
14 years 11 months ago
Closed-loop optimal experiment design: The partial correlation approach
Abstract-- We consider optimal experiment design for parametric prediction error system identification of linear timeinvariant systems in closed loop. The optimisation is performed...
Roland Hildebrand, Michel Gevers, Gabriel Solari
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 11 months ago
SafeVchat: Detecting Obscene Content and Misbehaving Users in Online Video Chat Services
Online video chat services such as Chatroulette, Omegle, and vChatter that randomly match pairs of users in video chat sessions are fast becoming very popular, with over a million...
Xinyu Xing, Yu-Li Liang, Hanqiang Cheng, Jianxun D...
ICDAR
2011
IEEE
14 years 4 months ago
Graph Clustering-Based Ensemble Method for Handwritten Text Line Segmentation
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
Vasant Manohar, Shiv Naga Prasad Vitaladevuni, Hua...
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 7 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
15 years 9 months ago
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
Yusuke Kobayashi, Christian Sommer 0002