Sciweavers

24 search results - page 5 / 5
» Edge colouring by total labellings
Sort
View
121
Voted
WWW
2011
ACM
14 years 8 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
121
Voted
3DIM
2007
IEEE
15 years 8 months ago
Generalized MPU Implicits Using Belief Propagation
In this paper, we present a new algorithm to reconstruct 3D surfaces from an unorganized point cloud based on generalizing the MPU implicit algorithm through introducing a powerfu...
Yi-Ling Chen, Shang-Hong Lai, Tung-Ying Lee
160
Voted
PC
2012
228views Management» more  PC 2012»
13 years 9 months ago
DAGuE: A generic distributed DAG engine for High Performance Computing
— The frenetic development of the current architectures places a strain on the current state-of-the-art programming environments. Harnessing the full potential of such architectu...
George Bosilca, Aurelien Bouteiller, Anthony Danal...
184
Voted
WG
2010
Springer
15 years 5 days ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski