4913 search results - page 125 / 983 » Results and Perspectives of the G |
164
click to vote
DEDS
2002
15 years 6 months ago
2002
We address the following sensor selection problem. We assume that a dynamic system possesses a certain property, call it Property D, when a set G of sensors is used. There is a cos...
148
click to vote
DM
1998
15 years 6 months ago
1998
The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same colo...
160
click to vote
DM
2008
15 years 6 months ago
2008
A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton path (a path including every vertex of G); and G is s-hamiltonian-connected if the deleti...
176
click to vote
RSA
2011
15 years 28 days ago
2011
Abstract. In this paper we study the minimal number τ(S, G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of...
144
click to vote
ERCIMDL
2007
Springer
16 years 19 days ago
2007
Springer
We consider search engines and collaborative tagging systems from the perspective of resource discovery and re-finding on the Web. We performed repeated searches over nine-months o...