Sciweavers

1629 search results - page 180 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
107
Voted
ANCS
2008
ACM
15 years 5 days ago
On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
Yunyue Lin, Qishi Wu
SPE
2008
91views more  SPE 2008»
14 years 10 months ago
A multiple layer model to compare RNA secondary structures
composed of various graphs linked together by relations of abstraction/refinement. The new structure is useful for representing information that can be described at t levels of abs...
Julien Allali, Marie-France Sagot
90
Voted
PAMI
2010
190views more  PAMI 2010»
14 years 8 months ago
OBJCUT: Efficient Segmentation Using Top-Down and Bottom-Up Cues
—We present a probabilistic method for segmenting instances of a particular object category within an image. Our approach overcomes the deficiencies of previous segmentation tech...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
84
Voted
ICPP
1999
IEEE
15 years 2 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward
99
Voted
BROADNETS
2006
IEEE
15 years 1 months ago
Efficient Integration of Web Services in Ambient-aware Sensor Network Applications
Sensor webs are heterogeneous collections of sensor devices that collect information and interact with the environment. They consist of wireless sensor networks that are ensembles ...
Isaac Amundson, Manish Kushwaha, Xenofon D. Koutso...