CORR
2010
Springer
13 years 6 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
COMPENG
2010
13 years 6 months ago
2010
COMPENG
2010
13 years 6 months ago
2010
Infrastructures are becoming more and more interoperable, while stakeholders are not aware of the overall behavior. In order achieve a global awareness, in this paper the need for ...
DCC
2011
IEEE
13 years 6 months ago
2011
IEEE
—We propose a method to improve traditional character-based PPM text compression algorithms. Consider a text file as a sequence of alternating words and non-words, the basic ide...
COLING
2010
13 years 6 months ago
2010
We conduct a series of Part-of-Speech (POS) Tagging experiments using Expectation Maximization (EM), Variational Bayes (VB) and Gibbs Sampling (GS) against the Chinese Penn Treeba...
COLING
2010
13 years 6 months ago
2010
Although much work in NLP has focused on simply determining what a document means, we also must know whether or not to believe it. Fact-finding algorithms attempt to identify the ...
CORR
2011
Springer
2011
Springer
Iterative Reweighted Algorithms for Sparse Signal Recovery with Temporally Correlated Source Vectors
13 years 6 months ago
Iterative reweighted algorithms, as a class of algorithms for sparse signal recovery, have been found to have better performance than their non-reweighted counterparts. However, f...
CLEF
2010
Springer
13 years 6 months ago
2010
Springer
Nowadays, plagiarism has been presented as one of the main distresses that the information technology revolution has lead into our society for which using pattern matching algorith...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
CORR
2011
Springer
13 years 6 months ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...