Sciweavers

4112 search results - page 76 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
ICIP
2009
IEEE
15 years 1 months ago
Selecting representative and distinctive descriptors for efficient landmark recognition
To have a robust and informative image content representation for image categorization, we often need to extract as many as possible visual features at various locations, scales a...
Sheng Gao, Joo-Hwee Lim
BIBM
2009
IEEE
190views Bioinformatics» more  BIBM 2009»
15 years 1 months ago
A Fast, Semi-automatic Brain Structure Segmentation Algorithm for Magnetic Resonance Imaging
Abstract--Medical image segmentation has become an essential technique in clinical and research-oriented applications. Because manual segmentation methods are tedious, and fully au...
Kevin Karsch, Qing He, Ye Duan
109
Voted
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 4 months ago
Improved results for a memory allocation problem
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
Leah Epstein, Rob van Stee
TON
2010
162views more  TON 2010»
14 years 10 months ago
Fast Algorithms for Resource Allocation in Wireless Cellular Networks
Abstract--We consider a scheduled orthogonal frequency division multiplexed (OFDM) wireless cellular network where the channels from the base-station to the mobile users undergo fl...
Ritesh Madan, Stephen P. Boyd, Sanjay Lall
IPL
2008
114views more  IPL 2008»
15 years 4 months ago
Faster algorithms for guided tree edit distance
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
Dekel Tsur