Sciweavers

562 search results - page 85 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
IVC
2007
114views more  IVC 2007»
13 years 8 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
BMCBI
2006
138views more  BMCBI 2006»
13 years 8 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
14 years 1 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 10 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
14 years 5 days ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...