Sciweavers

720 search results - page 114 / 144
» Linear k-arboricities on trees
Sort
View
166
Voted
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
15 years 11 months ago
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
Mirit Shalem, Ziv Bar-Yossef
MICCAI
2007
Springer
15 years 10 months ago
High Throughput Analysis of Breast Cancer Specimens on the Grid
Breast cancer accounts for about 30% of all cancers and 15% of all cancer deaths in women in the United States. Advances in computer assisted diagnosis (CAD) holds promise for earl...
Lin Yang, Wenjin Chen, Peter Meer, Gratian Salaru,...
76
Voted
ICML
2008
IEEE
15 years 10 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
WWW
2009
ACM
15 years 10 months ago
Predicting click through rate for job listings
Click Through Rate (CTR) is an important metric for ad systems, job portals, recommendation systems. CTR impacts publisher's revenue, advertiser's bid amounts in "p...
Manish S. Gupta
177
Voted
POPL
2009
ACM
15 years 10 months ago
Types and higher-order recursion schemes for verification of higher-order programs
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
Naoki Kobayashi