2137 search results - page 193 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
184
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
165
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
197
click to vote
INFOCOM
2006
IEEE
16 years 13 days ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
182
Voted
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
156
Voted
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...