Sciweavers

567 search results - page 46 / 114
» Exact train pathing
Sort
View
ADC
2008
Springer
141views Database» more  ADC 2008»
15 years 6 months ago
Approximate Retrieval of XML Data with ApproXPath
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...
Lin Xu, Curtis E. Dyreson
ICNP
2007
IEEE
15 years 6 months ago
Lexicographic products in metarouting
— Routing protocols often keep track of multiple route metrics, where some metrics are more important than others. Route selection is then based on lexicographic comparison: the ...
Alexander J. T. Gurney, Timothy G. Griffin
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
15 years 6 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
ICMCS
2006
IEEE
124views Multimedia» more  ICMCS 2006»
15 years 5 months ago
Streaming of Scalable Video from Multiple Servers using Rateless Codes
This paper presents a framework for efficiently streaming scalable video from multiple servers over heterogeneous network paths. We propose to use rateless codes, or Fountain cod...
Jean-Paul Wagner, Jacob Chakareski, Pascal Frossar...
ECAI
2010
Springer
15 years 28 days ago
EP for Efficient Stochastic Control with Obstacles
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
Thomas Mensink, Jakob J. Verbeek, Bert Kappen