Sciweavers

1477 search results - page 199 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
CP
2003
Springer
15 years 3 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 1 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
CN
1999
100views more  CN 1999»
14 years 9 months ago
Testing protocols modeled as FSMs with timing parameters
An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active t...
M. Ümit Uyar, Mariusz A. Fecko, Adarshpal S. ...
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
14 years 10 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
BMVC
2010
14 years 4 months ago
Saliency Segmentation based on Learning and Graph Cut Refinement
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...
Paria Mehrani, Olga Veksler