Sciweavers

193 search results - page 16 / 39
» Members of Random Closed Sets
Sort
View
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 1 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
SPIRE
2009
Springer
15 years 4 months ago
Faster Algorithms for Sampling and Counting Biological Sequences
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
Christina Boucher
84
Voted
BMCBI
2008
114views more  BMCBI 2008»
14 years 12 months ago
Visualizing and clustering high throughput sub-cellular localization imaging
Background: The expansion of automatic imaging technologies has created a need to be able to efficiently compare and review large sets of image data. To enable comparisons of imag...
Nicholas A. Hamilton, Rohan D. Teasdale
ICML
2000
IEEE
16 years 16 days ago
Using Error-Correcting Codes for Text Classification
This paper explores in detail the use of Error Correcting Output Coding (ECOC) for learning text classifiers. We show that the accuracy of a Naive Bayes Classifier over text class...
Rayid Ghani
TIT
2008
95views more  TIT 2008»
14 years 11 months ago
On the Delay and Throughput Gains of Coding in Unreliable Networks
In an unreliable packet network setting, we study the performance gains of optimal transmission strategies in the presence and absence of coding capability at the transmitter, wher...
Atilla Eryilmaz, Asuman E. Ozdaglar, Muriel M&eacu...