Sciweavers

1265 search results - page 197 / 253
» Finding the Key to a Synapse
Sort
View
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 8 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
IPL
2002
125views more  IPL 2002»
13 years 8 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards
NAR
2002
109views more  NAR 2002»
13 years 8 months ago
The Molecular Biology Database Collection: 2002 update
The Molecular Biology Database Collection is an online resource listing key databases of value to the biological community. This Collection is intended to bring fellow scientists&...
Andreas D. Baxevanis
SIAMDM
2002
94views more  SIAMDM 2002»
13 years 8 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
SIAMJO
2002
142views more  SIAMJO 2002»
13 years 8 months ago
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...