Sciweavers

1148 search results - page 227 / 230
» Using a relational database for scalable XML search
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 10 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
CIKM
2009
Springer
14 years 3 days ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
CIKM
2008
Springer
13 years 9 months ago
How should users access the content of digital books?
I report briefly on some of my own work in each of these areas and elucidate some of the questions that this research has raised. Then I propose as a research agenda the developme...
Nina Wacholder
BMCBI
2010
135views more  BMCBI 2010»
13 years 7 months ago
Integration and visualization of systems biology data in context of the genome
Background: High-density tiling arrays and new sequencing technologies are generating rapidly increasing volumes of transcriptome and protein-DNA interaction data. Visualization a...
J. Christopher Bare, Tie Koide, David J. Reiss, Da...
IMCS
2007
144views more  IMCS 2007»
13 years 7 months ago
On the imbalance of the security problem space and its expected consequences
Purpose – This paper aims to report on the results of an analysis of the computer security problem space, to suggest the areas with highest potential for making progress in the ...
Konstantin Beznosov, Olga Beznosova