Sciweavers

194 search results - page 26 / 39
» Computing Roundness is Easy if the Set is Almost Round
Sort
View
BMEI
2008
IEEE
13 years 9 months ago
Clustering of High-Dimensional Gene Expression Data with Feature Filtering Methods and Diffusion Maps
The importance of gene expression data in cancer diagnosis and treatment by now has been widely recognized by cancer researchers in recent years. However, one of the major challen...
Rui Xu, Steven Damelin, Boaz Nadler, Donald C. Wun...
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 9 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
IPPS
2006
IEEE
14 years 1 months ago
On collaborative content distribution using multi-message gossip
We study epidemic schemes in the context of collaborative data delivery. In this context, multiple chunks of data reside at different nodes, and the challenge is to simultaneousl...
Yaacov Fernandess, Dahlia Malkhi
DAC
2006
ACM
14 years 8 months ago
A real time budgeting method for module-level-pipelined bus based system using bus scenarios
In designing bus based systems with parallel and pipelined architecture, it is important to derive a real time budget (a specified execution time limit) for each task of a bus bas...
Tadaaki Tanimoto, Seiji Yamaguchi, Akio Nakata, Te...
SOFSEM
2010
Springer
14 years 4 months ago
Parallel Randomized Load Balancing: A Lower Bound for a More General Model
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
Guy Even, Moti Medina