Sciweavers

331 search results - page 38 / 67
» Fast Matching for All Pairs Similarity Search
Sort
View
IVC
2007
114views more  IVC 2007»
14 years 9 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...
RECOMB
2006
Springer
15 years 10 months ago
A New Approach to Protein Identification
Advances in tandem mass-spectrometry (MS/MS) steadily increase the rate of generation of MS/MS spectra and make it more computationally challenging to analyze such huge datasets. A...
Nuno Bandeira, Dekel Tsur, Ari Frank, Pavel A. Pev...
77
Voted
ASPDAC
2005
ACM
99views Hardware» more  ASPDAC 2005»
14 years 11 months ago
A fast counterexample minimization approach with refutation analysis and incremental SAT
- It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
ShengYu Shen, Ying Qin, Sikun Li
CIKM
2006
Springer
15 years 1 months ago
Structure-based querying of proteins using wavelets
The ability to retrieve molecules based on structural similarity has use in many applications, from disease diagnosis and treatment to drug discovery and design. In this paper, we...
Keith Marsolo, Srinivasan Parthasarathy, Kotagiri ...
ICASSP
2008
IEEE
15 years 4 months ago
Fast query by example of environmental sounds via robust and efficient cluster-based indexing
There has been much recent progress in the technical infrastructure necessary to continuously characterize and archive all sounds, or more precisely auditory streams, that occur w...
Jiachen Xue, Gordon Wichern, Harvey D. Thornburg, ...