Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJCSS, Volume 76
Volume 76, Number 1, February 2010
- Radim Belohlávek, Rudolf Kruse:
Editor's foreword. 1-2 - Radim Belohlávek, Vilém Vychodil:
Discovery of optimal factors in binary data via a novel method of matrix decomposition. 3-20 - Christian Borgelt:
A conditional independence algorithm for learning undirected graphical models. 21-33 - Petr Hájek, Martin Holena, Jan Rauch:
The GUHA method and its meaning for data mining. 34-48 - Eyke Hüllermeier, Johannes Fürnkranz
:
On predictive accuracy and risk minimization in pairwise label ranking. 49-62 - Guoqing Liu, Vladik Kreinovich:
Fast convolution and Fast Fourier Transform under interval and fuzzy uncertainty. 63-76 - Matthias Steinbrecher, Rudolf Kruse:
Visualizing and fuzzy filtering for discovering temporal trajectories of association rules. 77-87 - Karam Gouda, Mosab Hassaan, Mohammed J. Zaki:
Prism: An effective approach for frequent sequence mining via prime-block encoding. 88-102
Volume 76, Number 2, March 2010
- Marko Samer, Stefan Szeider:
Constraint satisfaction with bounded treewidth revisited. 103-114 - Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild:
Pattern matching with don't cares and few errors. 115-124 - H. M. W. Verbeek, Moe Thandar Wynn, Wil M. P. van der Aalst, Arthur H. M. ter Hofstede:
Reduction rules for reset/inhibitor nets. 125-143 - Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo:
FPT algorithms and kernels for the Directed k-Leaf problem. 144-152
Volume 76, Numbers 3-4, May - June 2010
- Nikolaj S. Bjørner, Andreas Blass, Yuri Gurevich:
Content-dependent chunking for differential compression, the local maximum approach. 154-203 - Michael Dom, Jiong Guo, Rolf Niedermeier:
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems. 204-221 - Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Communication algorithms with advice. 222-232 - Sanjay Jain, Frank Stephan:
Numberings optimal for learning. 233-250 - Alexander Okhotin:
Decision problems for language equations. 251-266 - Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
An approximation trichotomy for Boolean #CSP. 267-277
- Benjamin I. P. Rubinstein, Peter L. Bartlett, J. Hyam Rubinstein:
Corrigendum to "Shifting: One-inclusion mistake bounds and sample compression" [J. Comput. System Sci 75 (1) (2009) 37-59]. 278-280
Volume 76, Number 5, August 2010
- Wilfrid Hodges, Ruy J. G. B. de Queiroz:
Editors' foreword for JCSS WoLLIC 2008. 281-282 - Christophe Calvès, Maribel Fernández:
Matching and alpha-equivalence check for nominal terms. 283-301 - Olivier Danvy, Jacob Johannsen:
Inter-deriving semantic artifacts for object-oriented programming. 302-323 - Anuj Dawar:
Homomorphism preservation on quasi-wide classes. 324-332 - Santiago Figueira, Daniel Gorín, Rafael Grimson:
On the formal semantics of IF-like logics. 333-346 - Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao:
Adversary lower bounds for nonadaptive quantum algorithms. 347-355 - Ilya Mezhirov, Nikolay K. Vereshchagin:
On abstract resource semantics and computability logic. 356-372 - Livio Robaldo:
Interpretation and inference with maximal referential terms. 373-388
Volume 76, Number 6, September 2010
- Jinjun Chen, Lizhe Wang:
Special issue: Scientific workflow 2009. 389 - Ping Yang, Shiyong Lu, Mikhail I. Gofman, Zijiang Yang:
Information flow analysis of scientific workflows. 390-402 - Rafael Tolosana-Calasanz, José Ángel Bañares, Pedro Álvarez, Joaquín Ezpeleta, Omer F. Rana:
An uncoordinated asynchronous checkpointing model for hierarchical scientific workflows. 403-415 - Wanchun Dou, J. Leon Zhao, Shaokun Fan:
A collaborative scheduling approach for service-driven scientific workflow execution. 416-427 - Scott Callaghan, Ewa Deelman, Dan Gunter, Gideon Juve, Philip Maechling, Christopher X. Brooks, Karan Vahi, Kevin Milner, Robert Graves, Edward Field, David Okaya, Thomas H. Jordan:
Scaling up workflow-based applications. 428-446 - Daniel Zinn, Shawn Bowers, Sven Köhler, Bertram Ludäscher:
Parallelizing XML data-streaming workflows via MapReduce. 447-463 - Jinjun Chen, Yun Yang:
Localising temporal constraints in scientific workflows. 464-474 - Jiangang Ma, Jinli Cao, Yanchun Zhang:
Efficiently supporting secure and reliable collaboration in scientific workflows. 475-489 - Jacek Sroka, Jan Hidders, Paolo Missier, Carole A. Goble:
A formal semantics for the Taverna 2 workflow model. 490-508
Volume 76, Number 7, November 2010
- Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay:
Isomorphism and canonization of tournaments and hypertournaments. 509-523 - Faisal N. Abu-Khzam:
A kernelization algorithm for d-Hitting Set. 524-531 - Joachim Wehler:
Simplified proof of the blocking theorem for free-choice Petri nets. 532-537 - Bart Kuijpers, Walied Othman:
Trajectory databases: Data models, uncertainty and complete query languages. 538-560 - Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Generalized modal satisfiability. 561-578 - Hubie Chen, Omer Giménez:
Causal graphs and structurally restricted planning. 579-592 - Henning Fernau, Michael Kaufmann, Mathias Poths:
Comparing trees via crossing minimization. 593-608 - Miroslav Ciric, Aleksandar Stamenkovic, Jelena Ignjatovic, Tatjana Petkovic:
Fuzzy relation equations and reduction of fuzzy automata. 609-633 - Miki Hermann, Reinhard Pichler:
Counting complexity of propositional abduction. 634-649 - Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo:
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. 650-662 - Jesús Arias-Fisteus, Norberto Fernández García, Luis Sánchez Fernández, Carlos Delgado Kloos:
Hashing and canonicalizing Notation 3 graphs. 663-685 - S. Muthukrishnan, Gopal Pandurangan:
Thresholding random geometric graph properties motivated by ad hoc sensor networks. 686-696
Volume 76, Number 8, December 2010
- Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang:
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph. 697-708 - Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer:
Connected facility location via random facility sampling and core detouring. 709-726 - Michael R. Fellows, Jiong Guo, Iyad A. Kanj:
The parameterized complexity of some minimum label problems. 727-740 - Saehwa Kim:
Dual ceiling protocol for real-time synchronization under preemption threshold scheduling. 741-750 - Dekel Tsur:
Sequencing by hybridization in few rounds. 751-758 - Ofer Dekel, Felix A. Fischer, Ariel D. Procaccia:
Incentive compatible regression learning. 759-777 - Tony Tan:
On pebble automata for data languages with decidable emptiness problem. 778-791 - Christian Glaßer:
Space-efficient informational redundancy. 792-811 - Nadja Betzler, Britta Dorn:
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules. 812-836 - Tomás Masopust:
Simple restriction in context-free rewriting. 837-846 - Hubie Chen, Martin Grohe:
Constraint satisfaction with succinctly specified relations. 847-860 - Arto Salomaa:
Subword balance, position indices and power sums. 861-871 - Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo:
Betweenness parameterized above tight lower bound. 872-878 - David Gamarnik, Dmitriy Katz:
A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix. 879-883 - Shlomi Dolev, Ronen I. Kat, Elad Michael Schiller:
When consensus meets self-stabilization. 884-900
a service of 
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.
last updated on 2024-04-19 19:20 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:
