620 search results - page 97 / 124 » A Simple and Fast Min-cut Algorithm |
103
click to vote
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
VLDB
2001
ACM
15 years 4 months ago
2001
ACM
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
SPAA
1997
ACM
15 years 4 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
105
click to vote
BMCBI
2006
14 years 11 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
ICRA
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper, we describe a modular software that allows fast development of eye-in-hand image-based visual servoing applications (ViSP states for "Visual Servoing Platform&...