Stem certain$ (all stems)

35 papers:

VLDB-2015-KohlerLZ #sql

Possible and Certain SQL Key (HK, SL, XZ), pp. 1118–1129.

VLDB-2014-GrecoPW #consistency #database #query

Certain Query Answering in Partially Consistent Databases (SG, FP, JW), pp. 353–364.

KR-2014-Libkin

Certain Answers as Objects and Knowledge (LL).

SIGIR-2014-WanZ #named #summary

CTSUM: extracting more certain summaries for news articles (XW, JZ), pp. 787–796.

PODS-2013-Wijsen #query

Charting the tractability frontier of certain conjunctive query answering (JW), pp. 189–200.

ICALP-v2-2013-Widmayer #nondeterminism

To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous (PW), p. 36.

PODS-2011-Libkin #modelling

Incomplete information and certain answers in general data models (LL), pp. 59–70.

VLDB-2011-FanLMTY #named

CerFix: A System for Cleaning Data with Certain Fixes (WF, JL, SM, NT, WY), pp. 1375–1378.

ICALP-v1-2011-ODonnellWZ #fourier

The Fourier Entropy-Influence Conjecture for Certain Classes of Boolean Functions (RO, JW, YZ), pp. 330–341.

CIKM-2011-LiuFYW #enterprise

Finding relevant information of certain types from enterprise data (XL, HF, CY, MW), pp. 47–56.

SAC-2011-DebroyW #equivalence #fault #locality #on the

On the equivalence of certain fault localization techniques (VD, WEW), pp. 1457–1463.

PODS-2010-DavidLM #query #xml

Certain answers for XML queries (CD, LL, FM), pp. 191–202.

PODS-2010-Wijsen #database #first-order #nondeterminism #on the #query

On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases (JW), pp. 179–190.

VLDB-2010-FanLMTY #editing #towards

Towards Certain Fixes with Editing Rules and Master Data (WF, JL, SM, NT, WY), pp. 173–184.

DLT-2009-Souza #decidability #equivalence #on the #transducer

On the Decidability of the Equivalence for a Certain Class of Transducers (RdS), pp. 478–489.

HCI-NT-2009-HaywoodB #quote

“I Love My iPhone ... But There Are Certain Things That ‘Niggle’ Me” (AH, GB), pp. 421–430.

KDD-2009-DeodharG #mining #predict

Mining for the most certain predictions from dyadic data (MD, JG), pp. 249–258.

CADE-2009-Sofronie-Stokkermans #locality

Locality Results for Certain Extensions of Theories with Bridging Functions (VSS), pp. 67–83.

CIKM-2008-ZhouYM #biology

A system for finding biological entities that satisfy certain conditions from texts (WZ, CTY, WM), pp. 1281–1290.

SAC-2007-Ries #trust

Certain trust: a trust model for users and agents (SR), pp. 1599–1604.

ICEIS-AIDSS-2006-Nair #development #image #multi #summary

Development of Summaries of Certain Patterns in Multi-Band Satellite Images (HN), pp. 278–284.

ICEIS-2002-Greene #enterprise #information management #network

Enterprise Information Systems and the Global Information Network: Change is Certain, Progress is Optional (TG), p. 5.

LICS-2002-Tiwari #confluence #polynomial #term rewriting

Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time (AT), p. 447–?.

ICALP-2001-ShankarKSR

Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct (PS, PNAK, HS, BSR), pp. 627–638.

STOC-2000-GuruswamiS #algorithm

List decoding algorithms for certain concatenated codes (VG, MS), pp. 181–190.

KDD-2000-Papadimitriou #data mining #mining #on the

On certain rigorous approaches to data mining (invited talk, abstract only) (CHP), p. 2.

ICFP-1999-Crary #parametricity #proving

A Simple Proof Technique for Certain Parametricity Results (KC), pp. 82–89.

ICALP-1994-BirgetMMW #algorithm #problem

PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups (JCB, SWM, JCM, PW), pp. 274–285.

DLT-1993-Raz #context-free grammar #equivalence #multi

Deciding Multiplicity Equivalence for Certain Context-free Languages (DR), pp. 18–29.

STOC-1987-Kaltofen #complexity

Single-Factor Hensel Lifting and its Application to the Straight-Line Complexity of Certain Polynomials (EK), pp. 443–452.

RTA-1987-MadlenerO #finite #string #term rewriting

Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems (KM, FO), pp. 133–144.

GG-1982-Schnitzler #graph #morphism #problem

The isomorphism problem is polynomially solvable for certain graph languages (MS), pp. 369–379.

STOC-1974-Kung #algorithm #bound #evaluation #parallel

New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions (HTK), pp. 323–333.

STOC-1972-Kirkpatrick #on the

On the Additions Necessary to Compute Certain Functions (DGK), pp. 94–101.

STOC-1969-Spira #on the

On the Computation Time of Certain Classes of Boolean Functions (PMS), pp. 271–272.