Sciweavers

2254 search results - page 165 / 451
» Computing the minimal covering set
Sort
View
ACCV
2009
Springer
16 years 1 months ago
Planar Scene Modeling from Quasiconvex Subproblems
In this paper, we propose a convex optimization based approach for piecewise planar reconstruction. We show that the task of reconstructing a piecewise planar environment can be se...
Visesh Chari, Anil Kumar Nelakanti, Chetan Jakkoju...
ICPR
2000
IEEE
15 years 11 months ago
Scaling-Up Support Vector Machines Using Boosting Algorithm
In the recent years support vector machines (SVMs) have been successfully applied to solve a large number of classification problems. Training an SVM, usually posed as a quadrati...
Dmitry Pavlov, Jianchang Mao, Byron Dom
FLAIRS
2006
15 years 8 months ago
Dependency-based Textual Entailment
This paper studies the role of dependency information for the task of textual entailment. Both the Text and Hypothesis of an entailment pair are mapped into sets of dependencies a...
Vasile Rus
ICPR
2000
IEEE
16 years 7 months ago
Tandem Fusion of Nearest Neighbor Editing and Condensing Algorithms - Data Dimensionality Effects
In this paper, the effect of the dimensionality of data sets on the exploitation of synergy among known nearest neighbor (NN) editing and condensing tools is analyzed using a synt...
Belur V. Dasarathy, José Salvador Sá...
AUTOMATICA
2010
106views more  AUTOMATICA 2010»
15 years 5 months ago
Fault detection for discrete event systems using Petri nets with unobservable transitions
In this paper we present an efficient approach for the fault detection of discrete event systems using Petri nets. We assume that some of the transitions of the net are unobservabl...
Maria Paola Cabasino, Alessandro Giua, Carla Seatz...