1802 search results - page 325 / 361 » Complexity Theory for Operators in Analysis |
144
click to vote
SPAA
2009
ACM
15 years 12 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
140
click to vote
BIRTHDAY
2009
Springer
15 years 12 months ago
2009
Springer
Super-resolution is the art of creating nice high-resolution raster images from given low-resolution raster images. Since “nice” is not a well-defined term in mathematics and ...
183
click to vote
PRDC
2009
IEEE
15 years 11 months ago
2009
IEEE
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
155
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
154
click to vote
SIGIR
2009
ACM
15 years 11 months ago
2009
ACM
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...