Sciweavers

6266 search results - page 1142 / 1254
» New results on the computability and complexity of points - ...
Sort
View
MOBICOM
2003
ACM
14 years 1 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
BMCBI
2006
100views more  BMCBI 2006»
13 years 7 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
ANCS
2010
ACM
13 years 5 months ago
DOS: a scalable optical switch for datacenters
This paper discusses the architecture and performance studies of Datacenter Optical Switch (DOS) designed for scalable and highthroughput interconnections within a data center. DO...
Xiaohui Ye, Yawei Yin, S. J. Ben Yoo, Paul Vincent...
BMVC
2010
13 years 5 months ago
Improved Anatomical Landmark Localization in Medical Images Using Dense Matching of Graphical Models
We propose a method for reliably and accurately identifying anatomical landmarks in 3D CT volumes based on dense matching of parts-based graphical models. Such a system can be use...
Vaclav Potesil, Timor Kadir, Günther Platsch,...
IPPS
2008
IEEE
14 years 2 months ago
Providing security to the Desktop Data Grid
Volunteer Computing is becoming a new paradigm not only for the Computational Grid, but also for institutions using production-level Data Grids because of the enormous storage pot...
Jesus Luna, Michail Flouris, Manolis Marazakis, An...
« Prev « First page 1142 / 1254 Last » Next »