Sciweavers

2370 search results - page 256 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
ISBI
2009
IEEE
15 years 10 months ago
Structural Annotation of EM Images by Graph Cut
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
Hang Chang, Manfred Auer, Bahram Parvin
HPDC
2009
IEEE
15 years 10 months ago
Interconnect agnostic checkpoint/restart in open MPI
Long running High Performance Computing (HPC) applications at scale must be able to tolerate inevitable faults if they are to harness current and future HPC systems. Message Passi...
Joshua Hursey, Timothy Mattox, Andrew Lumsdaine
IEEECGIV
2009
IEEE
15 years 10 months ago
Surface Mesh Segmentation Using Local Geometry
—We present a novel algorithm to segment a 3D surface mesh into visually meaningful regions. Our approach is based on an analysis of the local geometry of vertices. In particular...
Chansophea Chuon, Sumanta Guha
INFOCOM
2009
IEEE
15 years 10 months ago
Encounter-Based Routing in DTNs
—Current work in routing protocols for delay and disruption tolerant networks leverage epidemic-style algorithms that trade off injecting many copies of messages into the network...
Samuel C. Nelson, Mehedi Bakht, Robin Kravets
AAIM
2009
Springer
118views Algorithms» more  AAIM 2009»
15 years 10 months ago
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...