Sciweavers

1369 search results - page 163 / 274
» Lattice computations for random numbers
Sort
View
ICCS
2005
Springer
14 years 2 months ago
Highly Scalable Algorithms for Robust String Barcoding
: String barcoding is a recently introduced technique for genomic based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms fo...
Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoi...
ICIAR
2005
Springer
14 years 2 months ago
Robust Global Mosaic Topology Estimation for Real-Time Applications
This paper proposes an iterative methodology for real-time robust mosaic topology inference. It tackles the problem of optimal feature selection (optimal sampling) for global estim...
Nuno Pinho da Silva, João Paulo Costeira
ICICS
2005
Springer
14 years 2 months ago
Private Itemset Support Counting
Private itemset support counting (PISC) is a basic building block of various privacy-preserving data mining algorithms. Briefly, in PISC, Client wants to know the support of her i...
Sven Laur, Helger Lipmaa, Taneli Mielikäinen
MIDDLEWARE
2005
Springer
14 years 2 months ago
Frugal Event Dissemination in a Mobile Environment
Abstract. This paper describes an event dissemination algorithm that impletopic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is...
Sébastien Baehni, Chirdeep Singh Chhabra, R...
COMPGEOM
2004
ACM
14 years 2 months ago
Range counting over multidimensional data streams
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou