Sciweavers

1940 search results - page 351 / 388
» Optimizing search engines using clickthrough data
Sort
View
SIGIR
2009
ACM
14 years 3 months ago
Fast nonparametric matrix factorization for large-scale collaborative filtering
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
Kai Yu, Shenghuo Zhu, John D. Lafferty, Yihong Gon...
NAR
2007
95views more  NAR 2007»
13 years 8 months ago
VisANT 3.0: new modules for pathway visualization, editing, prediction and construction
With the integration of the KEGG and Predictome databases as well as two search engines for coexpressed genes/proteins using data sets obtained from the Stanford Microarray Databa...
Zhenjun Hu, David M. Ng, Takuji Yamada, Chunnuan C...
CLOUD
2010
ACM
14 years 1 months ago
Nephele/PACTs: a programming model and execution framework for web-scale analytical processing
We present a parallel data processor centered around a programming model of so called Parallelization Contracts (PACTs) and the scalable parallel execution engine Nephele [18]. Th...
Dominic Battré, Stephan Ewen, Fabian Hueske...
CIKM
2011
Springer
12 years 8 months ago
Building directories for social tagging systems
Today, a number of algorithms exist for constructing tag hierarchies from social tagging data. While these algorithms were designed with ontological goals in mind, we know very li...
Denis Helic, Markus Strohmaier
ICCAD
2007
IEEE
165views Hardware» more  ICCAD 2007»
14 years 22 days ago
Automated refinement checking of concurrent systems
Stepwise refinement is at the core of many approaches to synthesis and optimization of hardware and software systems. For instance, it can be used to build a synthesis approach for...
Sudipta Kundu, Sorin Lerner, Rajesh Gupta