Sciweavers

48 search results - page 10 / 10
» Rankers over Infinite Words
Sort
View
JUCS
2008
140views more  JUCS 2008»
13 years 7 months ago
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
Klaus Weihrauch
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 9 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
JUCS
2010
152views more  JUCS 2010»
13 years 2 months ago
Compositional Semantics of Dataflow Networks with Query-Driven Communication of Exact Values
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...
Michal Konecný, Amin Farjudian