Sciweavers

1508 search results - page 38 / 302
» Efficient Path Profiling
Sort
View
CGO
2006
IEEE
14 years 2 months ago
Profiling over Adaptive Ranges
Modern computer systems are called on to deal with billions of events every second, whether they are instructions executed, memory locations accessed, or packets forwarded. This p...
Shashidhar Mysore, Banit Agrawal, Timothy Sherwood...
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 11 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
PERCOM
2004
ACM
14 years 10 months ago
Virtual Paths Routing: A Highly Dynamic Routing Protocol for Ad Hoc Wireless Networks
In this paper, we introduce the Virtual Paths Routing (VPR) Protocol for ad hoc wireless networks. VPR provides highly dynamic, correct, and efficient paths creation and maintenan...
Abdulrahman H. Altalhi, Golden G. Richard III
MVA
1998
230views Computer Vision» more  MVA 1998»
14 years 9 days ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
BMCBI
2006
199views more  BMCBI 2006»
13 years 11 months ago
PageMan: An interactive ontology tool to generate, display, and annotate overview graphs for profiling experiments
Background: Microarray technology has become a widely accepted and standardized tool in biology. The first microarray data analysis programs were developed to support pair-wise co...
Björn Usadel, Axel Nagel, Dirk Steinhauser, Y...