3008 search results - page 230 / 602 » Independence in connected graphs |
165
click to vote
ESA
2005
Springer
16 years 5 days ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
188
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
146
click to vote
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
190
click to vote
MFCS
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
235
click to vote
GPC
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Large-scale distributed computing applications require concurrent programming models that support modular and compositional software development. The actor model supports...