Sciweavers

3405 search results - page 454 / 681
» Factoring Groups Efficiently
Sort
View
ACMSE
2004
ACM
16 years 2 days ago
Trust based adaptive on demand ad hoc routing protocol
In this paper, we propose a routing protocol that is based on securing the routing information from unauthorized users. Even though routing protocols of this category are already ...
Rajiv K. Nekkanti, Chung-wei Lee
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
15 years 7 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
BMCBI
2007
133views more  BMCBI 2007»
15 years 6 months ago
MATLIGN: a motif clustering, comparison and matching tool
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...
Matti Kankainen, Ari Löytynoja
COMGEO
2004
ACM
15 years 6 months ago
A local search approximation algorithm for k-means clustering
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 6 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson