Sciweavers

526 search results - page 30 / 106
» Increments of Random Partitions
Sort
View
PIMRC
2008
IEEE
14 years 2 months ago
Comparative performance evaluation of MAC protocols in ad hoc networks with bandwidth partitioning
—This paper considers the performance of the MAC protocols ALOHA and CSMA in wireless ad hoc networks, where the total system bandwidth may be divided into smaller subbands. In t...
Mariam Kaynia, Geir E. Øien, Nihar Jindal, ...
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
13 years 8 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
DAC
2008
ACM
14 years 9 months ago
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
Ruei-Rung Lee, Jie-Hong Roland Jiang, Wei-Lun Hung
FPGA
2008
ACM
191views FPGA» more  FPGA 2008»
13 years 10 months ago
A hardware framework for the fast generation of multiple long-period random number streams
Stochastic simulations and other scientific applications that depend on random numbers are increasingly implemented in a parallelized manner in programmable logic. High-quality ps...
Ishaan L. Dalal, Deian Stefan
ICIP
2007
IEEE
14 years 2 months ago
Modeling vs. Segmenting Images Using A Probabilistic Approach
Image segmentation is conventionally formulated as a pixellabeling problem, in which “hard” decisions have to be made to partition pixels into regions. As image segmentation i...
Datong Chen