3008 search results - page 337 / 602 » Independence in connected graphs |
229
click to vote
ICALT
2006
IEEE
16 years 1 months ago
2006
IEEE
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...
191
Voted
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
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,...
197
click to vote
IROS
2006
IEEE
16 years 1 months ago
2006
IEEE
— 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...
183
Voted
ICRA
2005
IEEE
16 years 1 months ago
2005
IEEE
— 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...
168
click to vote
COCOON
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...