default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSandra Zilles
Person information
- affiliation: University of Regina, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j39]Yuan Xue, Boting Yang, Sandra Zilles:
The zero-visibility cops and robber game on graph products. Theor. Comput. Sci. 1007: 114676 (2024)- [j38]Mohamadsadegh Khosravani, Sandra Zilles:
Using Sum-Product Networks to Assess Uncertainty in Deep Active Learning. Trans. Mach. Learn. Res. 2024 (2024) - [c83]Abu Mohammad Hammad Ali, Boting Yang, Sandra Zilles:
Approximation Algorithms for Preference Aggregation Using CP-Nets. AAAI 2024: 10433-10441 - [c82]Shaun M. Fallat, Valerii Maliuk, Seyed Ahmad Mojallal, Sandra Zilles:
Learning Hypertrees From Shortest Path Queries. ALT 2024: 574-589 - [c81]S. Mahmoud Mousawi, Sandra Zilles
:
Positive Characteristic Sets for Relational Pattern Languages. SOFSEM 2024: 398-412 - 2023
- [j37]Yuan Xue, Boting Yang, Sandra Zilles, Lusheng Wang:
Fast searching on cactus graphs. J. Comb. Optim. 45(3): 84 (2023) - [j36]Shaun M. Fallat, David G. Kirkpatrick, Hans Ulrich Simon, Abolghasem Soltani, Sandra Zilles:
On Batch Teaching Without Collusion. J. Mach. Learn. Res. 24: 40:1-40:33 (2023) - [j35]Dana Fisman, Hadar Frenkel, Sandra Zilles:
Inferring Symbolic Automata. Log. Methods Comput. Sci. 19(2) (2023) - [i12]Abu Mohammad Hammad Ali, Boting Yang, Sandra Zilles:
Approximation Algorithms for Preference Aggregation Using CP-Nets. CoRR abs/2312.09162 (2023) - 2022
- [j34]Yuan Xue, Boting Yang, Sandra Zilles:
A simple method for proving lower bounds in the zero-visibility cops and robber game. J. Comb. Optim. 43(5): 1545-1570 (2022) - [c80]Yuan Xue, Boting Yang, Sandra Zilles:
Fast Searching on k-Combinable Graphs. AAIM 2022: 394-405 - [c79]Elham Parhizkar, Mohammad Hossein Nikravan, Robert C. Holte, Sandra Zilles:
Using Change Detection to Adapt to Dynamically Changing Trustees. Canadian AI 2022 - [c78]Robert C. Holte, S. Mahmoud Mousawi, Sandra Zilles:
Distinguishing Relational Pattern Languages With a Small Number of Short Strings. ALT 2022: 498-514 - [c77]Dana Fisman, Hadar Frenkel, Sandra Zilles:
Inferring Symbolic Automata. CSL 2022: 21:1-21:19 - [c76]N. C. Ruckiya Sinorina, Howard J. Hamilton, Sandra Zilles:
Efficient Removal of Weak Associations in Consensus Clustering. ICAART (3) 2022: 326-335 - [c75]Farnam Mansouri, Hans Simon, Adish Singla, Sandra Zilles:
On Batch Teaching with Sample Complexity Bounded by VCD. NeurIPS 2022 - [i11]Mohamadsadegh Khosravani, Sandra Zilles:
Actively Learning Deep Neural Networks with Uncertainty Sampling Based on Sum-Product Networks. CoRR abs/2206.09798 (2022) - 2021
- [c74]Mohammad Hossein Nikravan, Marjan Movahedan, Sandra Zilles:
Precision-based Boosting. AAAI 2021: 9153-9160 - [c73]Abu Mohammad Hammad Ali, Howard J. Hamilton, Elizabeth Rayner, Boting Yang, Sandra Zilles:
Aggregating Preferences Represented by Conditional Preference Networks. ADT 2021: 3-18 - [i10]Dana Fisman, Hadar Frenkel, Sandra Zilles:
Inferring Symbolic Automata. CoRR abs/2112.14252 (2021) - 2020
- [j33]Eisa Alanazi, Malek Mouhoub, Sandra Zilles:
The complexity of exact learning of acyclic conditional preference networks from swap examples. Artif. Intell. 278 (2020) - [j32]Ashwani Kumar, Ali Hosseinnia, Alla Gagarinova, Sadhna Phanse, Sunyoung Kim, Khaled A Aly, Sandra Zilles, Mohan Babu:
A Gaussian process-based definition reveals new and bona fide genetic interactions compared to a multiplicative model in the Gram-negative Escherichia coli. Bioinform. 36(3): 880-889 (2020) - [j31]Fahimeh Bayeh, Ziyuan Gao, Sandra Zilles:
Finitely distinguishable erasing pattern languages. Theor. Comput. Sci. 808: 38-73 (2020) - [c72]Elham Parhizkar, Mohammad Hossein Nikravan, Robert C. Holte, Sandra Zilles:
Combining Direct Trust and Indirect Trust in Multi-Agent Systems. IJCAI 2020: 311-317 - [c71]M. Amir Salmaninejad, Sandra Zilles, René V. Mayorga:
Motion Path Planning of Two Robot Arms in a Common Workspace. SMC 2020: 45-51 - [i9]Dana Fisman, Hadar Frenkel, Sandra Zilles:
On the Complexity of Symbolic Finite-State Automata. CoRR abs/2011.05389 (2020)
2010 – 2019
- 2019
- [c70]Robert C. Holte, Sandra Zilles:
On the Optimal Efficiency of Cost-Algebraic A. AAAI 2019: 2288-2295 - [c69]Yuan Xue, Boting Yang, Sandra Zilles:
New Results on the Zero-Visibility Cops and Robber Game. AAIM 2019: 316-328 - [c68]David G. Kirkpatrick, Hans Ulrich Simon, Sandra Zilles:
Optimal Collusion-Free Teaching. ALT 2019: 506-528 - [c67]Elham Parhizkar, Mohammad Hossein Nikravan, Sandra Zilles:
Indirect Trust is Simple to Establish. IJCAI 2019: 3216-3222 - [c66]Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles:
A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber. IWOCA 2019: 442-454 - [i8]David G. Kirkpatrick, Hans Ulrich Simon, Sandra Zilles:
Optimal Collusion-Free Teaching. CoRR abs/1903.04012 (2019) - 2018
- [j30]Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles:
The Fast Search Number of a Complete k-Partite Graph. Algorithmica 80(12): 3959-3981 (2018) - [j29]Ziyuan Gao, Hans Ulrich Simon, Sandra Zilles:
On the teaching complexity of linear sets. Theor. Comput. Sci. 716: 107-123 (2018) - [i7]Eisa Alanazi, Malek Mouhoub, Sandra Zilles:
Interactive Learning of Acyclic Conditional Preference Networks. CoRR abs/1801.03968 (2018) - [i6]Xiaojin Zhu, Adish Singla, Sandra Zilles, Anna N. Rafferty:
An Overview of Machine Teaching. CoRR abs/1801.05927 (2018) - 2017
- [j28]Ziyuan Gao, Zeinab Mazadi, Regan Meloche, Hans Ulrich Simon, Sandra Zilles:
Distinguishing pattern languages with membership examples. Inf. Comput. 256: 348-371 (2017) - [j27]Ziyuan Gao, Christoph Ries, Hans Ulrich Simon, Sandra Zilles:
Preference-based Teaching. J. Mach. Learn. Res. 18: 31:1-31:32 (2017) - [c65]Jürgen Eckerle, Jingwei Chen, Nathan R. Sturtevant, Sandra Zilles, Robert C. Holte:
Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search. ICAPS 2017: 79-87 - [c64]Fahimeh Bayeh, Ziyuan Gao, Sandra Zilles:
Erasing Pattern Languages Distinguishable by a Finite Number of Strings. ALT 2017: 72-108 - [c63]Ziyuan Gao, David G. Kirkpatrick, Christoph Ries, Hans Ulrich Simon, Sandra Zilles:
Preference-based Teaching of Unions of Geometric Objects. ALT 2017: 185-207 - [c62]Jingwei Chen, Robert C. Holte, Sandra Zilles, Nathan R. Sturtevant:
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions. IJCAI 2017: 489-495 - [i5]Ziyuan Gao, Christoph Ries, Hans Ulrich Simon, Sandra Zilles:
Preference-based Teaching. CoRR abs/1702.02047 (2017) - [i4]Jingwei Chen, Robert C. Holte, Sandra Zilles, Nathan R. Sturtevant:
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions. CoRR abs/1703.03868 (2017) - [i3]Mehdi Sadeqi, Robert C. Holte, Sandra Zilles:
An Empirical Study of the Effects of Spurious Transitions on Abstraction-based Heuristics. CoRR abs/1711.05105 (2017) - 2016
- [j26]Levi H. S. Lelis, Roni Stern, Shahab Jabbari Arfaee, Sandra Zilles, Ariel Felner, Robert C. Holte:
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces. Artif. Intell. 230: 51-73 (2016) - [j25]Hassan Waqar Ahmad, Sandra Zilles, Howard J. Hamilton, Richard Dosselmann:
Prediction of retail prices of products using local competitors. Int. J. Bus. Intell. Data Min. 11(1): 19-30 (2016) - [j24]Ziyuan Gao, Frank Stephan, Sandra Zilles:
Partial learning of recursively enumerable languages. Theor. Comput. Sci. 620: 15-32 (2016) - [j23]Malte Darnstädt, Thorsten Kiss, Hans Ulrich Simon, Sandra Zilles:
Order compression schemes. Theor. Comput. Sci. 620: 73-90 (2016) - [c61]Achilles Beros, Ziyuan Gao, Sandra Zilles:
Classifying the Arithmetical Complexity of Teaching Models. ALT 2016: 145-160 - [c60]Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles:
Fast Searching on Complete k-partite Graphs. COCOA 2016: 159-174 - [c59]Ziyuan Gao, Christoph Ries, Hans Ulrich Simon, Sandra Zilles:
Preference-based Teaching. COLT 2016: 971-997 - [c58]Eisa Alanazi, Malek Mouhoub, Sandra Zilles:
The Complexity of Learning Acyclic CP-Nets. IJCAI 2016: 1361-1367 - [c57]Levi H. S. Lelis, Santiago Franco, Marvin Abisrror, Mike Barley, Sandra Zilles, Robert C. Holte:
Heuristic Subset Selection in Classical Planning. IJCAI 2016: 3185-3191 - [c56]Shankar Vembu, Sandra Zilles:
Interactive Learning from Multiple Noisy Labels. ECML/PKDD (1) 2016: 493-508 - [e5]Ronald Ortner, Hans Ulrich Simon, Sandra Zilles:
Algorithmic Learning Theory - 27th International Conference, ALT 2016, Bari, Italy, October 19-21, 2016, Proceedings. Lecture Notes in Computer Science 9925, 2016, ISBN 978-3-319-46378-0 [contents] - [r2]Sandra Zilles:
Inductive Inference. Encyclopedia of Algorithms 2016: 977-980 - [i2]Shankar Vembu, Sandra Zilles:
Interactive Learning from Multiple Noisy Labels. CoRR abs/1607.06988 (2016) - 2015
- [c55]Ziyuan Gao, Frank Stephan, Sandra Zilles:
Combining Models of Approximation with Partial Learning. ALT 2015: 56-70 - [c54]Ziyuan Gao, Hans Ulrich Simon, Sandra Zilles:
On the Teaching Complexity of Linear Sets. ALT 2015: 102-116 - [c53]Hans Ulrich Simon, Sandra Zilles:
Open Problem: Recursive Teaching Dimension Versus VC Dimension. COLT 2015: 1770-1772 - [c52]Mohammad Hossein Nikravan, Ashwani Kumar, Sandra Zilles:
Detecting Transmembrane Proteins Using Decision Trees. Discovery Science 2015: 146-160 - [e4]Kamalika Chaudhuri, Claudio Gentile, Sandra Zilles:
Algorithmic Learning Theory - 26th International Conference, ALT 2015, Banff, AB, Canada, October 4-6, 2015, Proceedings. Lecture Notes in Computer Science 9355, Springer 2015, ISBN 978-3-319-24485-3 [contents] - [i1]Ziyuan Gao, Frank Stephan, Sandra Zilles:
Combining Models of Approximation with Partial Learning. CoRR abs/1507.01215 (2015) - 2014
- [j22]Levi H. S. Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting optimal solution cost with conditional probabilities - Predicting optimal solution cost. Ann. Math. Artif. Intell. 72(3-4): 267-295 (2014) - [j21]David G. Kirkpatrick, Boting Yang, Sandra Zilles:
A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors. Int. J. Comput. Geom. Appl. 24(3): 225-236 (2014) - [j20]Thorsten Doliwa, Gaojian Fan, Hans Ulrich Simon, Sandra Zilles:
Recursive teaching dimension, VC-dimension and sample compression. J. Mach. Learn. Res. 15(1): 3107-3131 (2014) - [j19]Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles:
Algebraic methods proving Sauer's bound for teaching complexity. Theor. Comput. Sci. 558: 35-50 (2014) - [c51]Mehdi Sadeqi, Robert C. Holte, Sandra Zilles:
A Comparison of h 2 and MMM for Mutex Pair Detection Applied to Pattern Databases. Canadian AI 2014: 227-238 - [c50]Muhammad Rezaul Karim, Sandra Zilles:
Robust Features for Detecting Evasive Spammers in Twitter. Canadian AI 2014: 295-300 - [c49]Peter Auer, Alexander Clark, Thomas Zeugmann, Sandra Zilles:
Editors' Introduction. ALT 2014: 1-7 - [c48]Rahim Samei, Boting Yang, Sandra Zilles:
Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes. ALT 2014: 275-290 - [c47]Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles:
Sample Compression for Multi-label Concept Classes. COLT 2014: 371-393 - [c46]Zeinab Mazadi, Ziyuan Gao, Sandra Zilles:
Distinguishing Pattern Languages with Membership Examples. LATA 2014: 528-540 - [e3]Peter Auer, Alexander Clark, Thomas Zeugmann, Sandra Zilles:
Algorithmic Learning Theory - 25th International Conference, ALT 2014, Bled, Slovenia, October 8-10, 2014. Proceedings. Lecture Notes in Computer Science 8776, Springer 2014, ISBN 978-3-319-11661-7 [contents] - 2013
- [j18]Levi H. S. Lelis, Sandra Zilles, Robert C. Holte:
Predicting the size of IDA*'s search tree. Artif. Intell. 196: 53-76 (2013) - [j17]Sanjay Jain, Samuel E. Moelius III, Sandra Zilles:
Learning without coding. Theor. Comput. Sci. 473: 124-148 (2013) - [c45]Ziyuan Gao, Frank Stephan, Sandra Zilles:
Partial Learning of Recursively Enumerable Languages. ALT 2013: 113-127 - [c44]Malte Darnstädt, Thorsten Doliwa, Hans Ulrich Simon, Sandra Zilles:
Order Compression Schemes. ALT 2013: 173-187 - [c43]Levi H. S. Lelis, Sandra Zilles, Robert C. Holte:
Stratified tree search: a novel suboptimal heuristic search algorithm. AAMAS 2013: 555-562 - [c42]Mehdi Sadeqi, Robert C. Holte, Sandra Zilles:
Detecting Mutex Pairs in State Spaces by Sampling. Australasian Conference on Artificial Intelligence 2013: 490-501 - [c41]Cristina E. Manfredotti, Kim Steenstrup Pedersen, Howard J. Hamilton, Sandra Zilles:
Learning Models of Activities Involving Interacting Objects. IDA 2013: 285-297 - [c40]Mehdi Sadeqi, Robert C. Holte, Sandra Zilles:
Using Coarse State Space Abstractions to Detect Mutex Pairs. SARA 2013 - [e2]Osmar R. Zaïane, Sandra Zilles:
Advances in Artificial Intelligence, 26th Canadian Conference on Artificial Intelligence, Canadian AI 2013, Regina, SK, Canada, May 28-31, 2013. Proceedings. Lecture Notes in Computer Science 7884, Springer 2013, ISBN 978-3-642-38456-1 [contents] - 2012
- [c39]Levi Lelis, Sandra Zilles, Robert C. Holte:
Fast and Accurate Predictions of IDA*'s Performance. AAAI 2012: 514-520 - [c38]Levi Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling. ICAPS 2012 - [c37]Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles:
Sauer's Bound for a Notion of Teaching Complexity. ALT 2012: 96-110 - [c36]Shahin Jabbari, Robert C. Holte, Sandra Zilles:
PAC-Learning with General Class Noise Models. KI 2012: 73-84 - [c35]Xiaomin Zhang, Sandra Zilles, Robert C. Holte:
Improved Query Suggestion by Query Search. KI 2012: 205-216 - [c34]Michael Geilke, Sandra Zilles:
Polynomial-Time Algorithms for Learning Typed Pattern Languages. LATA 2012: 277-288 - [c33]Levi H. S. Lelis, Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte:
Learning Heuristic Functions Faster by Using Predicted Solution Costs. SOCS 2012: 166-167 - [c32]Levi H. S. Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract). SOCS 2012: 186-187 - 2011
- [j16]Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte:
Learning heuristic functions for large state spaces. Artif. Intell. 175(16-17): 2075-2098 (2011) - [j15]Sandra Zilles, Steffen Lange, Robert Holte, Martin Zinkevich:
Models of Cooperative Teaching and Learning. J. Mach. Learn. Res. 12: 349-384 (2011) - [j14]Gábor Lugosi, Sandra Zilles:
Preface. Theor. Comput. Sci. 412(19): 1755 (2011) - [c31]Levi Lelis, Sandra Zilles, Robert C. Holte:
Time Complexity of Iterative-Deepening A*: The Informativeness Pathology (Abstract). AAAI 2011: 1800-1801 - [c30]Paolo Viappiani, Sandra Zilles, Howard J. Hamilton, Craig Boutilier:
A Bayesian Concept Learning Approach to Crowdsourcing. Interactive Decision Theory and Game Theory 2011 - [c29]Paolo Viappiani, Sandra Zilles, Howard J. Hamilton, Craig Boutilier:
Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach. ADT 2011: 277-291 - [c28]Michael Geilke, Sandra Zilles:
Learning Relational Patterns. ALT 2011: 84-98 - [c27]Samuel E. Moelius, Sandra Zilles:
Erratum: Learning without Coding. ALT 2011: 452 - [c26]Cristina E. Manfredotti, David J. Fleet, Howard J. Hamilton, Sandra Zilles:
Simultaneous Tracking and Activity Recognition. ICTAI 2011: 189-196 - [c25]Paolo Viappiani, Sandra Zilles, Howard J. Hamilton, Craig Boutilier:
A Bayesian Concept Learning Approach to Crowdsourcing. ITWP@IJCAI 2011 - [c24]Levi Lelis, Sandra Zilles, Robert C. Holte:
Improved Prediction of IDA*'s Performance via Epsilon-Truncation. SOCS 2011: 108-116 - [c23]David G. Kirkpatrick, Sandra Zilles:
Competitive Search in Symmetric Trees. WADS 2011: 560-570 - 2010
- [j13]Sandra Zilles, Robert C. Holte:
The computational complexity of avoiding spurious states in state space abstraction. Artif. Intell. 174(14): 1072-1092 (2010) - [j12]Gábor Bartók, Csaba Szepesvári, Sandra Zilles:
Models of active learning in group-structured state spaces. Inf. Comput. 208(4): 364-384 (2010) - [j11]Sanjay Jain, Steffen Lange, Samuel E. Moelius, Sandra Zilles:
Incremental learning with temporary memory. Theor. Comput. Sci. 411(29-30): 2757-2772 (2010) - [c22]Thorsten Doliwa, Hans Ulrich Simon, Sandra Zilles:
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes. ALT 2010: 209-223 - [c21]Samuel E. Moelius, Sandra Zilles:
Learning without Coding. ALT 2010: 300-314 - [c20]Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte:
Bootstrap Learning of Heuristic Functions. SOCS 2010: 52-60
2000 – 2009
- 2009
- [c19]Andrew Foss, Osmar R. Zaïane, Sandra Zilles:
Unsupervised Class Separation of Multivariate Data through Cumulative Variance-Based Ranking. ICDM 2009: 139-148 - [c18]Sandra Zilles, Robert C. Holte:
Downward Path Preserving State Space Abstractions (Extended Abstract). SARA 2009 - [c17]Shen Jiang, Sandra Zilles, Robert C. Holte:
Query Suggestion by Query Search: A New Approach to User Support in Web Search. Web Intelligence 2009: 679-684 - [e1]Ricard Gavaldà, Gábor Lugosi, Thomas Zeugmann, Sandra Zilles:
Algorithmic Learning Theory, 20th International Conference, ALT 2009, Porto, Portugal, October 3-5, 2009. Proceedings. Lecture Notes in Computer Science 5809, Springer 2009, ISBN 978-3-642-04413-7 [contents] - 2008
- [j10]John Case, Takeshi Shinohara, Thomas Zeugmann, Sandra Zilles:
Foreword. Theor. Comput. Sci. 397(1-3): 1-3 (2008) - [j9]Thomas Zeugmann, Sandra Zilles:
Learning recursive functions: A survey. Theor. Comput. Sci. 397(1-3): 4-56 (2008) - [j8]Steffen Lange, Thomas Zeugmann, Sandra Zilles:
Learning indexed families of recursive languages from positive data: A survey. Theor. Comput. Sci. 397(1-3): 194-232 (2008) - [c16]Randy Goebel, Sandra Zilles, Christoph Ringlstetter, Andreas Dengel, Gunnar Aastrand Grimnes:
What Is the Role of the Semantic Layer Cake for Guiding the Use of Knowledge Representation and Machine Learning in the Development of the Semantic Web? AAAI Spring Symposium: Symbiotic Relationships between Semantic Web and Knowledge Engineering 2008: 45-50 - [c15]Gábor Bartók, Csaba Szepesvári, Sandra Zilles:
Active Learning of Group-Structured Environments. ALT 2008: 329-343 - [c14]Steffen Lange, Samuel E. Moelius, Sandra Zilles:
Learning with Temporary Memory. ALT 2008: 449-463 - [c13]Sandra Zilles, Steffen Lange, Robert Holte, Martin Zinkevich:
Teaching Dimensions based on Cooperative Learning. COLT 2008: 135-146 - [c12]Shen Jiang, Sandra Zilles, Robert Holte:
Empirical Analysis of the Rank Distribution of Relevant Documents in Web Search. Web Intelligence 2008: 208-213 - [r1]Sandra Zilles:
Inductive Inference. Encyclopedia of Algorithms 2008 - 2007
- [j7]Sanjay Jain, Steffen Lange, Sandra Zilles:
Some natural conditions on incremental learning. Inf. Comput. 205(11): 1671-1684 (2007) - [j6]Sanjay Jain, Steffen Lange, Sandra Zilles:
A general comparison of language learning from examples and from queries. Theor. Comput. Sci. 387(1): 51-66 (2007) - 2006
- [j5]Sandra Zilles:
An approach to intrinsic complexity of uniform learning. Theor. Comput. Sci. 364(1): 42-61 (2006) - [c11]Sanjay Jain, Steffen Lange, Sandra Zilles:
Towards a Better Understanding of Incremental Learning. ALT 2006: 169-183 - 2005
- [j4]Steffen Lange, Sandra Zilles:
Relations between Gold-style learning and query learning. Inf. Comput. 203(2): 211-237 (2005) - [j3]Sandra Zilles:
Increasing the power of uniform inductive learners. J. Comput. Syst. Sci. 70(4): 510-538 (2005) - [c10]Sanjay Jain, Steffen Lange, Sandra Zilles:
Gold-Style and Query Learning Under Various Constraints on the Target Class. ALT 2005: 226-240 - [c9]Steffen Lange, Sandra Zilles:
Algorithmic Learning: Formal Models and Prototypical Applications. Leipziger Informatik-Tage 2005: 57-80 - [c8]Bertin Klein, Tristan Miller, Sandra Zilles:
Security Issues for Pervasive Personalized Communication Systems. SPC 2005: 56-62 - 2004
- [j2]Steffen Lange, Sandra Zilles:
Formal language identification: query learning vs. Gold-style learning. Inf. Process. Lett. 91(6): 285-292 (2004) - [j1]Sandra Zilles:
Separation of uniform learning classes. Theor. Comput. Sci. 313(2): 229-265 (2004) - [c7]Steffen Lange, Sandra Zilles:
Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space. ALT 2004: 99-113 - [c6]Steffen Lange, Sandra Zilles:
Replacing Limit Learners with Equally Powerful One-Shot Query Learners. COLT 2004: 155-169 - 2003
- [b1]Sandra Zilles:
Uniform learning of recursive functions. University of Kaiserslautern, 2003, ISBN 3-89838-278-8, pp. 1-168 - [c5]Sandra Zilles:
Intrinsic Complexity of Uniform Learning. ALT 2003: 39-53 - [c4]Steffen Lange, Sandra Zilles:
On the Learnability of Erasing Pattern Languages in the Query Model. ALT 2003: 129-143 - 2002
- [c3]Sandra Zilles:
Merging Uniform Inductive Learners. COLT 2002: 201-215 - 2001
- [c2]Sandra Zilles:
On the Comparison of Inductive Inference Criteria for Uniform Learning of Finite Classes. ALT 2001: 251-266 - [c1]Sandra Zilles:
On the Synthesis of Strategies Identifying Recursive Functions. COLT/EuroCOLT 2001: 160-176
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-09-13 00:44 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:
