Sciweavers

251 search results - page 37 / 51
» Distributed algorithms for edge dominating sets
Sort
View
DEXA
2010
Springer
180views Database» more  DEXA 2010»
14 years 10 months ago
Identifying Interesting Instances for Probabilistic Skylines
Significant research efforts have recently been dedicated to modeling and querying uncertain data. In this paper, we focus on skyline analysis of uncertain data, modeled as uncert...
Yinian Qi, Mikhail J. Atallah
PODC
2009
ACM
15 years 10 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
MST
2010
98views more  MST 2010»
14 years 8 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
CW
2002
IEEE
15 years 2 months ago
Direct Segmentation for Reverse Engineering
In Reverse Engineering a physical object is digitally reconstructed from a set of boundary points. In the segmentation phase these points are grouped into subsets to facilitate co...
Marek Vanco, Guido Brunnett