Sciweavers

840 search results - page 75 / 168
» The Complexity of the Extended GCD Problem
Sort
View
PVLDB
2010
110views more  PVLDB 2010»
13 years 6 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...
SODA
2012
ACM
209views Algorithms» more  SODA 2012»
11 years 10 months ago
Simple and practical algorithm for sparse Fourier transform
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
ICPR
2004
IEEE
14 years 9 months ago
Gaussian Energy Functions for Registration without Correspondences
A new criterion based on Gaussian fields is introduced and applied to the task of automatic rigid registration of point-sets. The method defines a simple energy function, which is...
Andreas Koschan, Besma R. Abidi, Faysal Boughorbel...
RECOMB
2008
Springer
14 years 8 months ago
Computation of Median Gene Clusters
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
Sebastian Böcker, Katharina Jahn, Julia Mixta...
SIGECOM
2009
ACM
132views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Limited and online supply and the bayesian foundations of prior-free mechanism design
We study auctions for selling a limited supply of a single commodity in the case where the supply is known in advance and the case it is unknown and must be instead allocated in a...
Nikhil R. Devanur, Jason D. Hartline