Sciweavers

2393 search results - page 88 / 479
» Bounds-Consistent Local Search
Sort
View
141
Voted
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 3 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
CRV
2011
IEEE
352views Robotics» more  CRV 2011»
14 years 14 days ago
Conformative Filter: A Probabilistic Framework for Localization in Reduced Space
— Algorithmic problem reduction is a fundamental approach to problem solving in many fields, including robotics. To solve a problem using this scheme, we must reduce the problem...
Chatavut Viriyasuthee, Gregory Dudek
126
Voted
BMCBI
2011
14 years 4 months ago
RegNetB: Predicting Relevant Regulator-Gene Relationships in Localized Prostate Tumor Samples
Background: A central question in cancer biology is what changes cause a healthy cell to form a tumor. Gene expression data could provide insight into this question, but it is dif...
Angel Alvarez, Peter J. Woolf
130
Voted
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 6 days ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
FGCS
2008
95views more  FGCS 2008»
14 years 11 months ago
SemreX: Efficient search in a semantic overlay for literature retrieval
The World Wide Web is growing at such a pace that even the biggest centralized search engines are able to index only a small part of the available documents on the Internet. The d...
Hai Jin, Hanhua Chen