Sciweavers

4865 search results - page 443 / 973
» The Complexity of Graph Connectivity
Sort
View
IWPEC
2009
Springer
16 years 1 months ago
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
Henning Fernau, Joachim Kneis, Dieter Kratsch, Ale...
ICALT
2006
IEEE
16 years 29 days ago
A Shortest Learning Path Selection Algorithm in E-learning
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
Chengling Zhao, Liyong Wan
IPPS
2006
IEEE
16 years 28 days ago
Saburo, a tool for I/O and concurrency management in servers
This paper presents a Java framework based on separation of concerns and code generation concepts that facilitates development of concurrency and I/O in servers. In this approach,...
Gautier Loyauté, Rémi Forax, Gilles ...
IROS
2006
IEEE
108views Robotics» more  IROS 2006»
16 years 28 days ago
Sparse appearance based modeling for robot localization
— In appearance based robot localization a new image is matched with every image in the database. In this paper we describe how to reduce the number of images in this database wi...
Olaf Booij, Zoran Zivkovic, Ben J. A. Kröse
ICRA
2005
IEEE
113views Robotics» more  ICRA 2005»
16 years 15 days ago
A Sample-based Convex Cover for Rapidly Finding an Object in a 3-D Environment
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...
Alejandro Sarmiento, Rafael Murrieta-Cid, Seth Hut...