Sciweavers

1024 search results - page 95 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
14 years 22 days ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
SAC
2008
ACM
14 years 9 months ago
Removing useless variables in cost analysis of Java bytecode
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
CIKM
2010
Springer
14 years 8 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
BIBM
2010
IEEE
144views Bioinformatics» more  BIBM 2010»
14 years 8 months ago
Identification and quantification of abundant species from pyrosequences of 16S rRNA by consensus alignment
16S rRNA gene profiling has recently been boosted by the development of pyrosequencing methods. A common analysis is to group pyrosequences into Operational Taxonomic Units (OTUs),...
Yuzhen Ye
WWW
2010
ACM
15 years 1 months ago
Enabling entity-based aggregators for web 2.0 data
Selecting and presenting content culled from multiple heterogeneous and physically distributed sources is a challenging task. The exponential growth of the web data in modern time...
Ekaterini Ioannou, Claudia Niederée, Yannis...