2638 search results - page 147 / 528 » Random Geometric Complexes |
161
click to vote
ECCC
2000
15 years 6 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
204
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
177
click to vote
MVA
1990
15 years 7 months ago
1990
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
171
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
189
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...