15073 search results - page 344 / 3015 » Probabilistic algorithms for computing resultants |
126
Voted
JPDC
2008
15 years 4 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
133
Voted
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
The scheduler is a key component in determining the overall performance of a parallel computer, and as we show here, the schedulers in wide use today exhibit large unexplained gap...
141
Voted
HIPEAC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. High end routers are targeted at providing worst case throughput guarantees over latency. Caches on the other hand are meant to help latency not throughput in a tradition...
138
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
146
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...