Sciweavers

419 search results - page 23 / 84
» First Order Paths in Ordered Trees
Sort
View
AAAI
2007
14 years 4 days ago
Dynamic DFS Tree in ADOPT-ing
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
Marius-Calin Silaghi, Makoto Yokoo
ACMICEC
2003
ACM
87views ECommerce» more  ACMICEC 2003»
14 years 3 months ago
A comparison of two algorithms for multi-unit k-double auctions
We develop two algorithms to manage bid data in flexible, multi-unit double auctions. The first algorithm is a multi-unit extension of the 4-HEAP algorithm, and the second is a ...
Shengli Bao, Peter R. Wurman
ISBI
2009
IEEE
14 years 4 months ago
A New Interactive Method for Coronary Arteries Segmentation Based on Tubular Anisotropy
In this paper we present a new interactive method for tubular structure extraction. The main application and motivation for this work is vessel tracking in 3D medical images. The ...
Fethallah Benmansour, Laurent D. Cohen
ALGOSENSORS
2009
Springer
13 years 7 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
INFOCOM
1999
IEEE
14 years 2 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne