Sciweavers

1186 search results - page 104 / 238
» Improving Random Walk Performance
Sort
View
ICASSP
2008
IEEE
15 years 4 months ago
Query adaptative locality sensitive hashing
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
Herve Jegou, Laurent Amsaleg, Cordelia Schmid, Pat...
IJCNN
2008
IEEE
15 years 4 months ago
Learning to select relevant perspective in a dynamic environment
— When an agent observes its environment, there are two important characteristics of the perceived information. One is the relevance of information and the other is redundancy. T...
Zhihui Luo, David A. Bell, Barry McCollum, Qingxia...
CIVR
2007
Springer
139views Image Analysis» more  CIVR 2007»
15 years 4 months ago
Video search in concept subspace: a text-like paradigm
Though both quantity and quality of semantic concept detection in video are continuously improving, it still remains unclear how to exploit these detected concepts as semantic ind...
Xirong Li, Dong Wang, Jianmin Li, Bo Zhang
BMCBI
2005
127views more  BMCBI 2005»
14 years 9 months ago
Genomes are covered with ubiquitous 11 bp periodic patterns, the "class A flexible patterns"
Background: The genomes of prokaryotes and lower eukaryotes display a very strong 11 bp periodic bias in the distribution of their nucleotides. This bias is present throughout a g...
Etienne Larsabal, Antoine Danchin
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 5 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran