9842 search results - page 1838 / 1969 » Problem complexity |
108
click to vote
WG
1998
Springer
15 years 4 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
117
Voted
ACL
2006
15 years 2 months ago
2006
In this paper we report our work on building a POS tagger for a morphologically rich language- Hindi. The theme of the research is to vindicate the stand that- if morphology is st...
118
click to vote
TC
2010
14 years 11 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
JCNS
2011
14 years 7 months ago
2011
To understand the functional connectivity of neural networks, it is important to develop simple and incisive descriptors of multineuronal firing patterns. Analysis at the pairwise...
132
click to vote
KAIS
2011
14 years 7 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...