Sciweavers

661 search results - page 77 / 133
» Levels of a scale-free tree
Sort
View
ICNP
1999
IEEE
14 years 1 months ago
Scaling End-to-End Multicast Transports with a Topologically-Sensitive Group Formation Protocol
While the IP unicast service has proven successful, extending end-to-end adaptation to multicast has been a difficult problem. Unlike the unicast case, multicast protocols must su...
Sylvia Ratnasamy, Steven McCanne
CISIM
2007
IEEE
14 years 20 days ago
Semi-Automatic Segmentation of Fibrous Liver Tissue
This article presents a semi-automatic segmentation of the fibrous liver tissue in the in-vivo liver biopsy color images. The segmentation is performed using a tree-based classifi...
P. Andruszkiewicz, C. Boldak, J. Jaroszewicz
IPPS
1995
IEEE
14 years 8 days ago
Operating system support for concurrent remote task creation
This paper describes improvements to the Mach microkernel’s support for efficient application startup across multiple nodes in a cluster or massively parallel processor. Signifi...
Dejan S. Milojicic, David L. Black, Steven J. Sear...
ACL
2004
13 years 10 months ago
Long-Distance Dependency Resolution in Automatically Acquired Wide-Coverage PCFG-Based LFG Approximations
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
Aoife Cahill, Michael Burke, Ruth O'Donovan, Josef...
IJCAI
1997
13 years 10 months ago
Interleaved Depth-First Search
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
Pedro Meseguer