54 search results - page 10 / 11 » A Fully Dynamic Graph Algorithm for Recognizing Interval Gra... |
CIVR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper, we propose a novel Markov model-based formulation for the image annotation problem. In this formulation, we treat image annotation as a graph ranking problem, by de...
MICRO
2009
IEEE
14 years 1 days ago
2009
IEEE
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
EMSOFT
2010
Springer
13 years 3 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
IUI
2009
ACM
14 years 2 months ago
2009
ACM
Concept maps are an important tool to knowledge organization, representation, and sharing. Most current concept map tools do not provide full support for hand-drawn concept map cr...