Sciweavers

681 search results - page 47 / 137
» Searching with expectations
Sort
View
ICCV
2011
IEEE
13 years 11 months ago
Complementary Hashing for Approximate Nearest Neighbor Search
Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral...
Hao Xu, Jingdong Wang, Zhu Li, Gang Zeng, Shipeng ...
VTC
2006
IEEE
100views Communications» more  VTC 2006»
15 years 5 months ago
Initial and Post-Initial Acquisition in the Serial Search Based Noncoherent Multiple Transmit/Receive Antenna Aided DS-CDMA Down
— In this paper we investigate the issues of both initial and post-initial acquisition schemes in the multiple transmit/receive antenna aided DS-CDMA downlink, when communicating...
Seung Hwan Won, Lajos Hanzo
AIPS
2007
15 years 2 months ago
Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling
Many scheduling problems reside in uncertain and dynamic environments – tasks have a nonzero probability of failure and may need to be rescheduled. In these cases, an optimized ...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
BMCBI
2008
106views more  BMCBI 2008»
14 years 12 months ago
Searching for evolutionary distant RNA homologs within genomic sequences using partition function posterior probabilities
Background: Identification of RNA homologs within genomic stretches is difficult when pairwise sequence identity is low or unalignable flanking residues are present. In both cases...
Usman Roshan, Satish Chikkagoudar, Dennis R. Lives...
PR
2007
100views more  PR 2007»
14 years 11 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz