Sciweavers

2746 search results - page 401 / 550
» Bisubmodular Function Minimization
Sort
View
COCOA
2008
Springer
15 years 5 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
ECIS
2001
15 years 5 months ago
Web Technologies and Value Innovation in the Italian Retail Banking Industry
Interpreting the outcome of a recent survey on Internet banking in Europe, [CARIGNANI et al., 2000], we point the attention to the adoption of Web technologies in Italian retail b...
Francesco Virili, Andrea Carignani
IJES
2006
110views more  IJES 2006»
15 years 3 months ago
Partitioning bin-packing algorithms for distributed real-time systems
Embedded real-time systems must satisfy not only logical functional requirements but also para-functional properties such as timeliness, Quality of Service (QoS) and reliability. W...
Dionisio de Niz, Raj Rajkumar
JMIV
2006
176views more  JMIV 2006»
15 years 3 months ago
Segmentation of Vectorial Image Features Using Shape Gradients and Information Measures
In this paper, we propose to focus on the segmentation of vectorial features (e.g. vector fields or color intensity) using region-based active contours. We search for a domain that...
Ariane Herbulot, Stéphanie Jehan-Besson, St...
149
Voted
BMCBI
2004
133views more  BMCBI 2004»
15 years 3 months ago
Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction
Background: RNA secondary structure prediction methods based on probabilistic modeling can be developed using stochastic context-free grammars (SCFGs). Such methods can readily co...
Robin D. Dowell, Sean R. Eddy