Sciweavers

522 search results - page 95 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
IMC
2007
ACM
13 years 9 months ago
Understanding the limitations of transmit power control for indoor wlans
A wide range of transmit power control (TPC) algorithms have been proposed in recent literature to reduce interference and increase capacity in 802.11 wireless networks. However, ...
Vivek Shrivastava, Dheeraj Agrawal, Arunesh Mishra...
IMC
2007
ACM
13 years 9 months ago
On optimal probing for delay and loss measurement
Packet delay and loss are two fundamental measures of performance. Using active probing to measure delay and loss typically involves sending Poisson probes, on the basis of the PA...
François Baccelli, Sridhar Machiraju, Darry...
AGI
2008
13 years 9 months ago
Engineering Utopia
The likely advent of AGI and the long-established trend of improving computational hardware promise a dual revolution in coming decades: machines which are both more intelligent an...
J. Storrs Hall
CLA
2007
13 years 9 months ago
Representing Numeric Values in Concept Lattices
Formal Concept Analysis is based on the occurrence of symbolic attributes in individual objects, or observations. But, when the attribute is numeric, treatment has been awkward. In...
John L. Pfaltz
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir