5606 search results - page 985 / 1122 » Randomization Techniques for Graphs. |
186
click to vote
MDM
2009
Springer
16 years 28 days ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
141
click to vote
MODELS
2009
Springer
16 years 28 days ago
2009
Springer
We present a novel technique for applying two-level runtime models to distributed systems. Our approach uses graph rewriting rules to transform a high-level source model into one o...
164
click to vote
MODELS
2009
Springer
16 years 28 days ago
2009
Springer
Features identify core characteristics of software in order to produce families of programs. Through configuration, different variants of a program can be composed. Our approach...
154
click to vote
PKDD
2009
Springer
16 years 27 days ago
2009
Springer
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
158
click to vote
SEMWEB
2009
Springer
16 years 27 days ago
2009
Springer
This paper explores the application of restricted relationship graphs (RDF) and statistical NLP techniques to improve named entity annotation in challenging Informal English domain...