15033 search results - page 368 / 3007 » Complexity Theory and Algorithms |
199
Voted
ACMSE
2006
ACM
16 years 1 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
180
click to vote
ERSHOV
2003
Springer
16 years 19 days ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
185
click to vote
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
209
click to vote
WABI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. A recursive algorithm by Aho, Sagiv, Szymanski, and Ullman [1] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by...
207
Voted
RTSS
2000
IEEE
15 years 11 months ago
2000
IEEE
Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...