default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKalev Kask
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c26]Sakshi Agarwal, Kalev Kask, Alexander Ihler, Rina Dechter:
NeuroBE: Escalating neural network approximations of Bucket Elimination. UAI 2022: 11-21- 2021
- [c25]Yasaman Razeghi, Kalev Kask, Yadong Lu, Pierre Baldi, Sakshi Agarwal, Rina Dechter:
Deep Bucket Elimination. IJCAI 2021: 4235-4242 - 2020
- [c24]Kalev Kask, Bobak Pezeshki, Filjor Broka, Alexander Ihler, Rina Dechter:
Scaling Up AND/OR Abstraction Sampling. IJCAI 2020: 4266-4274
2010 – 2019
- 2018
- [j5]William Lam, Kalev Kask, Javier Larrosa, Rina Dechter:
Subproblem ordering heuristics for AND/OR best-first search. J. Comput. Syst. Sci. 94: 41-62 (2018) - [c23]Filjor Broka, Rina Dechter, Alexander Ihler, Kalev Kask:
Abstraction Sampling in Graphical Models. UAI 2018: 632-641 - 2017
- [j4]William Lam, Kalev Kask, Javier Larrosa, Rina Dechter:
Residual-Guided Look-Ahead in AND/OR Search for Graphical Models. J. Artif. Intell. Res. 60: 287-346 (2017) - 2016
- [c22]Rina Dechter, Kalev Kask, William Lam, Javier Larrosa:
Look-Ahead with Mini-Bucket Heuristics for MPE. AAAI 2016: 694-701 - [c21]William Lam, Kalev Kask, Rina Dechter, Javier Larrosa:
On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds. ECAI 2016: 1567-1568 - 2015
- [c20]William Lam, Kalev Kask, Rina Dechter:
Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation. SOCS 2015: 212-213 - 2014
- [c19]William Lam, Kalev Kask, Rina Dechter, Alexander Ihler:
Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics. SOCS 2014: 105-113 - [i6]Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter:
Join-Graph Propagation Algorithms. CoRR abs/1401.3489 (2014) - 2013
- [i5]Rina Dechter, Kalev Kask, Robert Mateescu:
Iterative Join-Graph Propagation. CoRR abs/1301.0564 (2013) - [i4]Kalev Kask, Rina Dechter:
Mini-Bucket Heuristics for Improved Search. CoRR abs/1301.6708 (2013) - [i3]Irina Rish, Kalev Kask, Rina Dechter:
Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding. CoRR abs/1301.7409 (2013) - 2012
- [i2]Kalev Kask, Rina Dechter, Andrew Gelfand:
BEEM : Bucket Elimination with External Memory. CoRR abs/1203.3487 (2012) - [i1]Radu Marinescu, Kalev Kask, Rina Dechter:
Systematic vs. Non-systematic Algorithms for Solving the MPE Task. CoRR abs/1212.2505 (2012) - 2011
- [c18]Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter:
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. AAAI 2011: 54-60 - [c17]Andrew Gelfand, Kalev Kask, Rina Dechter:
Stopping Rules for Randomized Greedy Triangulation Schemes. AAAI 2011: 1043-1048 - 2010
- [j3]Robert Mateescu, Kalev Kask, Vibhav Gogate
, Rina Dechter:
Join-Graph Propagation Algorithms. J. Artif. Intell. Res. 37: 279-328 (2010) - [c16]Kalev Kask, Rina Dechter, Andrew Gelfand:
BEEM : Bucket Elimination with External Memory. UAI 2010: 268-276
2000 – 2009
- 2005
- [j2]Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dechter:
Unifying tree decompositions for reasoning in graphical models. Artif. Intell. 166(1-2): 165-193 (2005) - 2004
- [c15]Kalev Kask, Rina Dechter, Vibhav Gogate:
Counting-Based Look-Ahead Schemes for Constraint Satisfaction. CP 2004: 317-331 - [c14]Kalev Kask, Rina Dechter, Vibhav Gogate:
New Look-Ahead Schemes for Constraint Satisfaction. AI&M 2004 - 2003
- [c13]Radu Marinescu, Kalev Kask, Rina Dechter:
Systematic vs. Non-systematic Algorithms for Solving the MPE Task. UAI 2003: 394-402 - 2002
- [c12]Rina Dechter, Kalev Kask, Eyal Bin, Roy Emek:
Generating Random Solutions for Constraint Satisfaction Problems. AAAI/IAAI 2002: 15-21 - [c11]Robert Mateescu, Rina Dechter, Kalev Kask:
Tree Approximation for Belief Updating. AAAI/IAAI 2002: 553-559 - [c10]Rina Dechter, Kalev Kask, Robert Mateescu:
Iterative Join-Graph Propagation. UAI 2002: 128-136 - 2001
- [j1]Kalev Kask, Rina Dechter:
A general scheme for automatic generation of search heuristics from specification dependencies. Artif. Intell. 129(1-2): 91-131 (2001) - [c9]Rina Dechter, Kalev Kask, Javier Larrosa:
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. CP 2001: 346-360 - 2000
- [c8]Kalev Kask:
New Search Heuristics for Max-CSP. CP 2000: 262-277
1990 – 1999
- 1999
- [c7]Kalev Kask, Rina Dechter:
Stochastic local search for Bayesian network. AISTATS 1999 - [c6]Kalev Kask, Rina Dechter:
Branch and Bound with Mini-Bucket Heuristics. IJCAI 1999: 426-435 - [c5]Kalev Kask, Rina Dechter:
Mini-Bucket Heuristics for Improved Search. UAI 1999: 314-323 - 1998
- [c4]Irina Rish, Kalev Kask, Rina Dechter:
Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding. UAI 1998: 455-463 - 1996
- [c3]Kalev Kask, Rina Dechter:
A Graph-Based Method for Improving GSAT. AAAI/IAAI, Vol. 1 1996: 350-355 - 1995
- [c2]Kalev Kask, Rina Dechter:
GSAT and Local Consistency. IJCAI (1) 1995: 616-623 - 1994
- [c1]Eddie Schwalb, Kalev Kask, Rina Dechter:
Temporal Reasoning with Constraints on Fluents and Events. AAAI 1994: 1067-1072
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-07 00:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
