Sciweavers

8728 search results - page 1355 / 1746
» On Reduct Construction Algorithms
Sort
View
ICSOC
2004
Springer
16 years 6 days ago
Knowledge-driven interactions with services across ad hoc networks
Service oriented computing, with its aim of unhindered interoperability, is an appropriate paradigm for ad hoc networks, which are characterized by physical mobility of heterogeno...
Rohan Sen, Radu Handorean, Gruia-Catalin Roman, Gr...
IFIP
2004
Springer
16 years 6 days ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
16 years 6 days ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
ISMS
2004
Springer
16 years 6 days ago
Liver Vessel Parameter Estimation from Tactile Imaging Information
Realistic tissue models require accurate representations of the properties of in vivo tissue. This study examines the potential for tactile imaging to measure tissue properties an...
Anna M. Galea, Robert D. Howe
LATIN
2004
Springer
16 years 5 days ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
« Prev « First page 1355 / 1746 Last » Next »