Sciweavers

9572 search results - page 229 / 1915
» Cover Algorithms and Their Combination
Sort
View
JUCS
2007
95views more  JUCS 2007»
15 years 6 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow
TMI
2002
248views more  TMI 2002»
15 years 6 months ago
Adaptive Elastic Segmentation of Brain MRI via Shape Model Guided Evolutionary Programming
This paper presents a fully automated segmentation method for medical images. The goal is to localize and parameterize a variety of types of structure in these images for subsequen...
Alain Pitiot, Arthur W. Toga, Paul M. Thompson
MOBIHOC
2006
ACM
16 years 6 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano
TAMC
2009
Springer
16 years 1 months ago
Searching Trees: An Essay
We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimens...
Henning Fernau, Daniel Raible
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 10 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...