Sciweavers

1363 search results - page 61 / 273
» The road coloring problem
Sort
View
ICCI
1991
15 years 1 months ago
On the k-Coloring of Intervals
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
Martin C. Carlisle, Errol L. Lloyd
CIE
2008
Springer
14 years 11 months ago
Interpreting Localized Computational Effects Using Operators of Higher Type
d abstract) John Longley Laboratory for Foundations of Computer Science School of Informatics, University of Edinburgh The King's Buildings, Mayfield Road Edinburgh EH9 3JZ, U...
John Longley
IJBIDM
2008
114views more  IJBIDM 2008»
14 years 9 months ago
Traffic mining in a road-network: How does the traffic flow?
: The flow of data coming from modern sensing devices enables the development of novel research techniques related to data management and knowledge extraction. In this work, we und...
Irene Ntoutsi, Nikos Mitsou, Gerasimos Marketos
PVLDB
2010
269views more  PVLDB 2010»
14 years 8 months ago
Shortest Path Computation on Air Indexes
Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobil...
Georgios Kellaris, Kyriakos Mouratidis
CHI
2007
ACM
15 years 10 months ago
An interface to support color blind computer users
A new method for adapting digital images so that they are suitable for color blind viewers is presented. In contrast to earlier automatic methods which formulate the problem of ad...
Luke Jefferson, Richard Harvey