Sciweavers

3360 search results - page 537 / 672
» Opportunistic Data Structures with Applications
Sort
View
160
Voted
ICIP
2010
IEEE
15 years 1 months ago
Spiral FFT: An efficient method for 3-D FFTS on spiral MRI contours
The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...
Christopher K. Turnes, Justin K. Romberg
139
Voted
IEEEVAST
2010
14 years 10 months ago
Improving the visual analysis of high-dimensional datasets using quality measures
Modern visualization methods are needed to cope with very highdimensional data. Efficient visual analytical techniques are required to extract the information content in these dat...
Georgia Albuquerque, Martin Eisemann, Dirk J. Lehm...
236
Voted
EMMCVPR
2011
Springer
14 years 3 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
134
Voted
KDD
2007
ACM
136views Data Mining» more  KDD 2007»
16 years 4 months ago
Information genealogy: uncovering the flow of ideas in non-hyperlinked document databases
We now have incrementally-grown databases of text documents ranging back for over a decade in areas ranging from personal email, to news-articles and conference proceedings. While...
Benyah Shaparenko, Thorsten Joachims
204
Voted
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
16 years 3 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu