Sciweavers

863 search results - page 56 / 173
» Links in edge-colored graphs
Sort
View
SIGCOMM
2009
ACM
14 years 3 months ago
Tuning message size in opportunistic mobile networks
We describe a new model for studying intermittently connected mobile networks, based on Markovian random temporal graphs, that captures the influence of message size, maximum tol...
John Whitbeck, Vania Conan, Marcelo Dias de Amorim
ICWE
2005
Springer
14 years 2 months ago
Identifying Websites with Flow Simulation
We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the conte...
Pierre Senellart
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 8 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
ICCS
2001
Springer
14 years 1 months ago
Learning to Generate CGs from Domain Specific Sentences
Automatically generating Conceptual Graphs (CGs) [1] from natural language sentences is a difficult task in using CG as a semantic (knowledge) representation language for natural l...
Lei Zhang, Yong Yu
IWQOS
2005
Springer
14 years 2 months ago
Overlay Networks with Linear Capacity Constraints
Abstract. Previous work have assumed an independent model for overlay networks: a graph with independent link capacities. We introduce a model of overlays (LCC-overlay) which incor...
Ying Zhu, Baochun Li