Sciweavers

250 search results - page 21 / 50
» A Parallel Iterative Improvement Stable Matching Algorithm
Sort
View
ICS
2005
Tsinghua U.
15 years 7 months ago
What is worth learning from parallel workloads?: a user and session based analysis
Learning useful and predictable features from past workloads and exploiting them well is a major source of improvement in many operating system problems. We review known parallel ...
Julia Zilber, Ofer Amit, David Talby
136
Voted
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 11 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
INFOCOM
2003
IEEE
15 years 7 months ago
Minimizing Request Blocking in All-Optical Rings
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
IPPS
2000
IEEE
15 years 6 months ago
Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...
Leonid Oliker, Xiaoye S. Li, Gerd Heber, Rupak Bis...
IPPS
2007
IEEE
15 years 8 months ago
Knowledge and Cache Conscious Algorithm Design and Systems Support for Data Mining Algorithms
The knowledge discovery process is interactive in nature and therefore minimizing query response time is imperative. The compute and memory intensive nature of data mining algorit...
Amol Ghoting, Gregory Buehrer, Matthew Goyder, Shi...