17366 search results - page 30 / 3474 » New Revision Algorithms |
GD
2003
Springer
14 years 3 months ago
2003
Springer
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...
NIPS
2004
13 years 11 months ago
2004
We propose a new set of criteria for learning algorithms in multi-agent systems, one that is more stringent and (we argue) better justified than previous proposed criteria. Our cr...
INFOCOM
2000
IEEE
14 years 2 months ago
2000
IEEE
Abstract—In this paper we propose a modification of the Explicit Congestion Notification (ECN) [1] to correct the bias against connections with long round trip times (RTT) of T...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Wireless ad hoc networks are power constrained since nodes operate with limited battery energy. Thus, energy consumption is crucial in the design of new ad hoc routing protocols. I...
ICRA
2009
IEEE
14 years 4 months ago
2009
IEEE
— In our recent work [1], [2], we proposed Point Feature Histograms (PFH) as robust multi-dimensional features which describe the local geometry around a point p for 3D point clo...