6111 search results - page 665 / 1223 » Time, Hardware, and Uniformity |
186
click to vote
STOC
1994
ACM
15 years 11 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
250
click to vote
FUN
2010
Springer
15 years 10 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
209
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
—We consider a cognitive radio network with distributed multiple secondary users, where each user independently searches for spectrum opportunities in multiple channels without e...
266
click to vote
GLOBECOM
2007
IEEE
15 years 7 months ago
2007
IEEE
—IEEE 802.11 Distributed Coordination Function (DCF) uses a binary exponential backoff algorithm to arbitrate simultaneous channel access by multiple stations. When a station sen...
176
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...