Sciweavers

1963 search results - page 84 / 393
» The Maximum Solution Problem on Graphs
Sort
View
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
14 years 11 months ago
GString: A Novel Approach for Efficient Search in Graph Databases
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
Haoliang Jiang, Haixun Wang, Philip S. Yu, Shuigen...
ICPR
2000
IEEE
14 years 1 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
IM
2007
13 years 11 months ago
Business-Driven Optimization of Policy-Based Management solutions
— We consider whether the off-line compilation of a set of Service Level Agreements (SLAs) into low-level management policies can lead to the runtime maximization of the overall ...
Issam Aib, Raouf Boutaba
COLOGNETWENTE
2009
13 years 11 months ago
Colored Trees in Edge-Colored Graphs
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
A. Abouelaoualim, V. Borozan, Yannis Manoussakis, ...
SAC
2009
ACM
14 years 4 months ago
Extending Problem Frames to deal with stakeholder problems
The Problem Frames approach captures problems as seen by developers, but not by stakeholders. This paper presents a framework that extends the problem diagram of the Problem Frame...
An Agent, Goal-Oriented Approach