8728 search results - page 176 / 1746 » On Reduct Construction Algorithms |
169
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
178
click to vote
ICSE
2005
IEEE-ACM
16 years 6 months ago
2005
IEEE-ACM
Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one ...
162
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
286
click to vote
ICDCN
2011
Springer
14 years 10 months ago
2011
Springer
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
161
click to vote
MICCAI
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Brain imaging provides a wealth of information that computers can explore at a massive scale. Categorizing the patterns of the human cortex has been a challenging issue f...