Sciweavers

176 search results - page 11 / 36
» On the analysis of queries with counting constraints
Sort
View
SAS
2001
Springer
166views Formal Methods» more  SAS 2001»
14 years 1 months ago
Estimating the Impact of Scalable Pointer Analysis on Optimization
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimiza...
Manuvir Das, Ben Liblit, Manuel Fähndrich, Ja...
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 9 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
EDBT
2012
ACM
224views Database» more  EDBT 2012»
11 years 11 months ago
Aggregate queries on probabilistic record linkages
Record linkage analysis, which matches records referring to the same real world entities from different data sets, is an important task in data integration. Uncertainty often exi...
Ming Hua, Jian Pei
WWW
2010
ACM
14 years 3 months ago
Exploring web scale language models for search query processing
It has been widely observed that search queries are composed in a very different style from that of the body or the title of a document. Many techniques explicitly accounting for...
Jian Huang 0002, Jianfeng Gao, Jiangbo Miao, Xiaol...
DISOPT
2007
155views more  DISOPT 2007»
13 years 8 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin