Sciweavers

925 search results - page 103 / 185
» Connectivity on Complete Lattices
Sort
View
CVPR
2004
IEEE
16 years 8 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
ICIP
2008
IEEE
16 years 7 months ago
Graph-based deinterlacing
This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fa...
Jérôme Roussel, Pascal Bertolino
IROS
2009
IEEE
144views Robotics» more  IROS 2009»
16 years 20 days ago
Experimental validation of a hybrid mobile robot mechanism with interchangeable locomotion and manipulation
—This video submission presents the experimental validation and testing of a novel Hybrid Mobile Robot (HMR) system design using a complete physical prototype. The HMR consists o...
Pinhas Ben-Tzvi
FSTTCS
2009
Springer
16 years 18 days ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...
IPOM
2009
Springer
16 years 18 days ago
A Labeled Data Set for Flow-Based Intrusion Detection
Abstract. Flow-based intrusion detection has recently become a promising security mechanism in high speed networks (1-10 Gbps). Despite the richness in contributions in this field...
Anna Sperotto, Ramin Sadre, Frank van Vliet, Aiko ...