2485 search results - page 86 / 497 » Time Bounded Frequency Computations |
140
click to vote
MOBIHOC
2006
ACM
16 years 4 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...
146
click to vote
BROADNETS
2006
IEEE
15 years 10 months ago
2006
IEEE
Existing slotted channel access schemes in wireless networks assume that slot boundaries at all nodes are synchronized. In practice, relative clock drifts among nodes cause slot mi...
105
click to vote
RECOMB
2009
Springer
15 years 11 months ago
2009
Springer
Abstract Constantinos Daskalakis1 , Elchanan Mossel2, , and Sebastien Roch1 1 Microsoft Research 2 UC Berkeley and Weizman Institute We introduce a new phylogenetic reconstruction ...
124
click to vote
SAT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
119
Voted
VTC
2008
IEEE
15 years 11 months ago
2008
IEEE
—Orthogonal frequency division multiplexing (OFDM) signals have a problem with high peak-to-average power ratio (PAPR). A distortionless selective mapping (SLM) has been proposed...