Sciweavers

2693 search results - page 184 / 539
» French Order Without Order
Sort
View
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
15 years 8 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu
ICPR
2010
IEEE
15 years 7 months ago
Probabilistic Clustering Using the Baum-Eagon Inequality
The paper introduces a framework for clustering data objects in a similarity-based context. The aim is to cluster objects into a given number of classes without imposing a hard pa...
Samuel Rota Bulo', Marcello Pelillo
AAAI
2007
15 years 6 months ago
Topological Mapping with Weak Sensory Data
In this paper, we consider the exploration of topological environments by a robot with weak sensory capabilities. We assume only that the robot can recognize when it has reached a...
Gregory Dudek, Dimitri Marinakis
ASSETS
2005
ACM
15 years 6 months ago
Wizard-of-Oz test of ARTUR: a computer-based speech training system with articulation correction
This study has been performed in order to test the manmachine interface of a computer-based speech training aid named ARTUR with the main feature that it can give suggestions on h...
Olle Bälter, Olov Engwall, Anne-Marie Ös...
RECOSOC
2007
115views Hardware» more  RECOSOC 2007»
15 years 5 months ago
Self-adaptive Security at Application Level: a Proposal
—Self-adaptive systems have the ability to adapt themselves to mutating external or internal conditions without requesting any intervention of the user; the security of such syst...
Alberto Ferrante, Antonio Vincenzo Taddeo, Mariagi...