1830 search results - page 242 / 366 » Workshop on Graph Computation Models |
153
Voted
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
134
click to vote
ADHOCNOW
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
140
click to vote
ACL
2010
15 years 3 months ago
2010
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...
206
click to vote
CVPR
2009
IEEE
17 years 7 days ago
2009
IEEE
In this paper, we propose a novel predictive model for
object boundary, which can integrate information from any
sources. The model is a dynamic “object” model whose
manifes...
153
click to vote
ECOOPW
1997
Springer
15 years 9 months ago
1997
Springer
The traditional workflow process model is typically illustrated with a graph of activities, tasks, deliverables and techniques. From an object-oriented perspective, every identifi...