973 search results - page 114 / 195 » New Bounds on Crossing Numbers |
169
click to vote
ECRTS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
173
click to vote
PODS
1997
ACM
15 years 10 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
175
click to vote
SIGGRAPH
1994
ACM
15 years 10 months ago
1994
ACM
In this paper we identify sources of error in global illumination algorithms and derive bounds for each distinct category. Errors arise from three sources: inaccuracies in the bou...
179
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
156
click to vote
NIPS
2007
15 years 7 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...