8728 search results - page 220 / 1746 » On Reduct Construction Algorithms |
158
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...
172
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
148
click to vote
SIAMSC
2008
15 years 6 months ago
2008
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
178
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Active learning may hold the key for solving the data scarcity problem in supervised learning, i.e., the lack of labeled data. Indeed, labeling data is a costly process, yet an ac...
171
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...