Sciweavers

7913 search results - page 9 / 1583
» Information Collection on a Graph
Sort
View
WMCSA
2002
IEEE
14 years 11 days ago
Context Aggregation and Dissemination in Ubiquitous Computing Systems
Many “ubiquitous computing” applications need a constant flow of information about their environment to be able to adapt to their changing context. To support these “contex...
Guanling Chen, David Kotz
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
14 years 24 days ago
Collective Tree Spanners of Graphs
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
CIKM
2008
Springer
13 years 9 months ago
Structure feature selection for graph classification
With the development of highly efficient graph data collection technology in many application fields, classification of graph data emerges as an important topic in the data mining...
Hongliang Fei, Jun Huan
WG
2005
Springer
14 years 28 days ago
Collective Tree 1-Spanners for Interval Graphs
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
Derek G. Corneil, Feodor F. Dragan, Ekkehard K&oum...
MKM
2004
Springer
14 years 25 days ago
A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics
As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, ...
Lori Lorigo, Jon M. Kleinberg, Richard Eaton, Robe...