895 search results - page 103 / 179 » Using graphs for some discrete tomography problems |
120
Voted
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
143
Voted
COR
2010
15 years 3 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
147
Voted
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
148
Voted
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
168
Voted
PRL
2011
14 years 10 months ago
2011
In some real world applications, such as spectrometry, functional models achieve better predictive performances if they work on the derivatives of order m of their inputs rather t...