Sciweavers

21 search results - page 4 / 5
» Fast Exhaustive Search for Polynomial Systems in F2
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 3 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
SIGIR
2011
ACM
13 years 1 months ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...
DEXA
1995
Springer
126views Database» more  DEXA 1995»
14 years 2 months ago
A Heuristic Approach for Optimization of Path Expressions
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
Cetin Ozkan, Asuman Dogac, Cem Evrendilek
BMCBI
2008
118views more  BMCBI 2008»
13 years 11 months ago
PseudoGeneQuest - Service for identification of different pseudogene types in the human genome
Background: Pseudogenes, nonfunctional copies of genes, evolve fast due the lack of evolutionary pressures and thus appear in several different forms. PseudoGeneQuest is an online...
Csaba P. Ortutay, Mauno Vihinen
WWW
2009
ACM
14 years 11 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...