Sciweavers

116 search results - page 10 / 24
» A New Intersection Model and Improved Algorithms for Toleran...
Sort
View
188
Voted

Publication
592views
17 years 1 days ago
Coupling Graph Cuts and Level Sets
"This paper presents an efficient algorithm for solving one sort of region-based active contour models, i.e. the active contours without edges model. We develop the link betwe...
Xiang Zeng, Wei Chen, and Qunsheng Peng
158
Voted
MST
2002
169views more  MST 2002»
15 years 3 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...
139
Voted
COCOA
2009
Springer
15 years 8 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
119
Voted
NN
1998
Springer
15 years 3 months ago
Distributed ARTMAP: a neural network for fast distributed supervised learning
Distributed coding at the hidden layer of a multi-layer perceptron (MLP) endows the network with memory compression and noise tolerance capabilities. However, an MLP typically req...
Gail A. Carpenter, Boriana L. Milenova, Benjamin W...
114
Voted
CEE
2007
107views more  CEE 2007»
15 years 3 months ago
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
Wenming Li, Krishna M. Kavi, Robert Akl