1456 search results - page 144 / 292 » Improved Randomized Results for That Interval Selection Prob... |
95
Voted
ESA
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
101
click to vote
CIAC
2006
Springer
15 years 2 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
101
click to vote
IJHIS
2007
14 years 11 months ago
2007
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
111
click to vote
COLING
2010
14 years 6 months ago
2010
We study a novel shallow information extraction problem that involves extracting sentences of a given set of topic categories from medical forum data. Given a corpus of medical fo...
MFCS
2004
Springer
15 years 4 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...