Sciweavers

656 search results - page 31 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
ESA
2008
Springer
92views Algorithms» more  ESA 2008»
14 years 11 months ago
How Reliable Are Practical Point-in-Polygon Strategies?
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...
Stefan Schirra
PPOPP
2009
ACM
15 years 10 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
96
Voted
MSWIM
2005
ACM
15 years 3 months ago
Randomized energy aware routing algorithms in mobile ad hoc networks
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...
Israat Tanzeena Haque, Chadi Assi, J. William Atwo...
70
Voted
ICML
2008
IEEE
15 years 10 months ago
Listwise approach to learning to rank: theory and algorithm
This paper aims to conduct a study on the listwise approach to learning to rank. The listwise approach learns a ranking function by taking individual lists as instances and minimi...
Fen Xia, Tie-Yan Liu, Jue Wang, Wensheng Zhang, Ha...
INFOCOM
2008
IEEE
15 years 4 months ago
Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?
Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information proc...
Patrick Denantes, Florence Bénézit, ...