|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10186 occurrences of 5176 keywords
|
|
|
Results
Found 18931 publication records. Showing 18931 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
85 | M. Molla-Hosseini, Roger M. Kerr, Robert B. Randall, R. B. Platfoot |
An Inspection Model with Minimal and Major Maintenance for a Flexible Manufacturing Cell using Generalized Stochastic Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Application and Theory of Petri Nets ![In: Application and Theory of Petri Nets 1995, 16th International Conference, Turin, Italy, June 26-30, 1995, Proceedings, pp. 335-356, 1995, Springer, 3-540-60029-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Notation n state of device, n 0: state following a Poisson failure, n 1: operating state, n 2: minimal maintenance state, k number of stages of deterioration before deterioration failure, s at maintenance event s after s-1 minimalmaintenance the maintenance must be a major maintenance, P(i,j,n) steady-state probability that the device is in state (i,j,n), i=deterioration-stage index, j=minimal maintenance number, Pd steady-state probability that the device is being overhauled after a deteriorating failure, P0 steady-state probability that the device is out of service due to major maintenance, minimal maintenance, minimal repair respectively, 1/ d mean time between as good as new and deterioration failure if no maintenance is initiated, 1/ 0 mean time to Poisson failure, 1/ m mean time to the next maintenance event, 1/ d mean duration of overhauling the device following a deterioration failure, 1/ m mean duration of minimal maintenance, 1/ M mean duration of major maintenance, 1/ 0 mean duration of repair after Poisson failure, U steady-state unavailability of the device, PM, Pm |
57 | Gang Xu 0001, Guozhao Wang |
Parametric Polynomial Minimal Surfaces of Degree Six with Isothermal Parameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Advances in Geometric Modeling and Processing, 5th International Conference, GMP 2008, Hangzhou, China, April 23-25, 2008. Proceedings, pp. 329-343, 2008, Springer, 978-3-540-79245-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
harmonic surfaces, isothermal parametric surface, parametric polynomial minimal surface of degree six, membrane structure, minimal surface |
52 | Peter R. Cappello |
A Processor-Time-Minimal Systolic Array for Cubical Mesh Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 3(1), pp. 4-13, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
hexagon shaped, cylinder connected, processor-time-minimal systolic array, cubical meshalgorithms, time-minimal multiprocessor schedules, processor-time-minimal scheduling, triangular shaped 2-D directed mesh, 2-D directed mesh, directedgraphs, parallel algorithms, computational complexity, topology, systolic arrays, directed acyclic graph, processing elements, matrix product |
52 | Hiroshi Sakai, Michinori Nakata |
Discernibility Functions and Minimal Rules in Non-deterministic Information Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSFDGrC (1) ![In: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 10th International Conference, RSFDGrC 2005, Regina, Canada, August 31 - September 3, 2005, Proceedings, Part I, pp. 254-264, 2005, Springer, 3-540-28653-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Minimal rules, Tool for rule generation, Rough sets, Non-deterministic information, Discernibility functions |
49 | Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton |
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 39(4), pp. 287-298, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Minimal triangulations, Minimal elimination ordering, Minimal fill, Chordal graphs |
45 | Tsong Yueh Chen, Man Fai Lau |
On the Minimal Essential Subsets and Minimal Representative Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ada-Europe ![In: Reliable Software Technologies - Ada-Europe 2000, 5th Ada-Europe International Conference, Potsdam, Germany, June 26-30, 2000, Proceedings, pp. 291-301, 2000, Springer, 3-540-67669-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
minimal essential set, minimal representative set, software testing, set covering, test suite reduction |
45 | James Bailey 0001, Peter J. Stuckey |
Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADL ![In: Practical Aspects of Declarative Languages, 7th International Symposium, PADL 2005, Long Beach, CA, USA, January 10-11, 2005, Proceedings, pp. 174-186, 2005, Springer, 3-540-24362-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Minimal unsatisfiable sets, constraint solving, hitting sets, hypergraph transversals |
45 | Guozhu Dong, Chunyu Jiang, Jian Pei, Jinyan Li 0001, Limsoon Wong |
Mining Succinct Systems of Minimal Generators of Formal Concepts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Database Systems for Advanced Applications, 10th International Conference, DASFAA 2005, Beijing, China, April 17-20, 2005, Proceedings, pp. 175-187, 2005, Springer, 3-540-25334-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
formal concepts, closed itemsets, succinctness, Minimal generators |
45 | Jie Wu 0001 |
Fault-Tolerant Adaptive and Minimal Routing in Mesh-Connected Multicomputers Using Extended Safety Levels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(2), pp. 149-159, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Fault tolerance, minimal routing, mesh-connected multicomputers |
44 | Luis Gravano, Gustavo D. Pifarré, Pablo E. Berman, Jorge L. C. Sanz |
Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(12), pp. 1233-1251, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
adaptive deadlock-free routing, livelock-free routing, n-dimensional torus network, packet-switched fully-adaptive minimal routing, 4-Classes, dynamic message injectionmodel, performance evaluation, concurrency control, multiprocessor interconnection networks, virtual channels, Channels, torus networks, buffer requirement, minimal paths, traffic patterns, message lengths |
44 | Gustavo D. Pifarré, Luis Gravano, Sergio A. Felperin, Jorge L. C. Sanz |
Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(3), pp. 247-263, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
adaptive minimal deadlock-free packet routing, virtual cut-through routing models, simulations, algorithms, concurrency control, message passing, hypercubes, multiprocessor interconnection networks, multiprocessor interconnection networks, meshes, packet switching, parallel machines, parallel machines, routing algorithms, deadlock, packet routing, shuffle-exchange, minimal paths, two-dimensional mesh |
42 | Zhen Jiang, Jie Wu 0001, Dajin Wang |
A New Fault Information Model for Fault-Tolerant Adaptive and Minimal Routing in 3-D Meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 34th International Conference on Parallel Processing (ICPP 2005), 14-17 June 2005, Oslo, Norway, pp. 500-507, 2005, IEEE Computer Society, 0-7695-2380-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
fault information models, 3-D meshes, fault tolerance, Adaptive routing, minimal routing |
41 | Alain Finkel |
The Minimal Coverability Graph for Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Applications and Theory of Petri Nets ![In: Advances in Petri Nets 1993, Papers from the 12th International Conference on Applications and Theory of Petri Nets, Gjern, Denmark, June 1991, pp. 210-243, 1991, Springer, 3-540-56689-9. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
Karp-Miller graph, minimal coverability graph, effective computation of the minimal coverability graph, verification of protocols, Petri nets, decidability |
39 | Marcus Brazil, Doreen A. Thomas, Jia F. Weng |
Gradient-constrained minimum networks (II). Labelled or locally minimal Steiner points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 42(1), pp. 23-37, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Minimum networks, Gradient constrained, Steiner trees, Locally minimal |
39 | Hajime Machida, Tamás Waldhauser |
Majority and Other Polynomials in Minimal Clones. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 22-23 May 2008, Dallas, Texas, USA, pp. 38-43, 2008, IEEE Computer Society, 978-0-7695-3155-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minimal clone, polynomial, clone, Galois field |
39 | Li Chen 0002, Paul P. Wang |
Fuzzy Relation Equations (II): The Branch-point-solutions and the Categorized Minimal Solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 11(1), pp. 33-40, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Minimal solutions, Branch-point-solutions, Algorithms, Computational complexity, Fuzzy relation equations |
37 | Michael Pedersen |
Compositional Definitions of Minimal Flows in Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CMSB ![In: Computational Methods in Systems Biology, 6th International Conference, CMSB 2008, Rostock, Germany, October 12-15, 2008. Proceedings, pp. 288-307, 2008, Springer, 978-3-540-88561-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minimal flows, minimal invariants, the Calculus of Biochemical Systems, Petri nets, modularity |
37 | Koji Iwanuma, Katsumi Inoue |
Minimal Answer Computation and SOL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence, European Conference, JELIA 2002, Cosenza, Italy, September, 23-26, Proceedings, pp. 245-258, 2002, Springer, 3-540-44190-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Ning Xu, Yunxiang Liu, Ruqi Zhou |
A Tentative Approach to Minimal Reducts by Combining Several Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (3) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 118-124, 2008, Springer, 978-3-540-85929-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minimal reduct, algorithm, rough sets, attribute reduction |
35 | Hajime Machida, Michael Pinsker |
Some Observations on Minimal Clones. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 36th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2006), 17-20 May 2006, Singapore, pp. 24, 2006, IEEE Computer Society, 0-7695-2532-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
minimal clone, Clone, Galois field |
35 | Francesca Cioffi |
Remarks on the Computation of Minimal Finite Free Resolutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 12(5), pp. 351-363, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Castelnuovo-Mumford regularity, minimal free resolution, Betti numbers |
35 | Jie Wu 0001 |
A Fault-Tolerant Adaptive and Minimal Routing Approach in 3-D Meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: Seventh International Conference on Parallel and Distributed Systems, ICPADS 2000, Iwate, Japan, July 4-7, 2000, pp. 256-263, 2000, IEEE Computer Society, 0-7695-0568-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
3-D meshes, fault tolerance, deadlock, adaptive routing, livelock, minimal routing |
35 | Honghua Dai 0001 |
A Minimal Causal Model Learner. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Methodologies for Knowledge Discovery and Data Mining, Third Pacific-Asia Conference, PAKDD-99, Beijing, China, April 26-28, 1999, Proceedings, pp. 400-408, 1999, Springer, 3-540-65866-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
causal discovery, data mining, machine learning, artificial intelligence, knowledge acquisition, Minimal model |
35 | Chris J. Scheiman, Peter R. Cappello |
A Period-Processor-Time-Minimal Schedule for Cubical Mesh Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(3), pp. 274-280, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
period-processor-time-minimal schedule, cubical mesh algorithms, precedence-constrained multiprocessor schedules, toroidally connected mesh, scheduling, parallel algorithms, computational complexity, multiprocessor interconnection networks, directed graphs, systolic arrays, systolic array, directed acyclic graph, matrix algebra, matrix product, computationalcomplexity |
34 | Mark H. Liffiton, Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João Marques-Silva 0001, Karem A. Sakallah |
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 14(4), pp. 415-442, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Infeasibility, Minimal unsatisfiable subformula, MUS, Smallest minimal unsatisfiable subformula, SMUS, SAT, Boolean satisfiability |
34 | José Manuel Colom, Manuel Silva Suárez |
Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal P-semiflows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Applications and Theory of Petri Nets ![In: Advances in Petri Nets 1990 [10th International Conference on Applications and Theory of Petri Nets, Bonn, Germany, June 1989, Proceedings], pp. 79-112, 1989, Springer, 3-540-53863-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
Structural analysis of P/T nets, Minimal semiflows, Extremal direction of a cone, Algorithms to compute all minimal semiflows, Tests of minimality, Convex Geometry |
33 | Lin Chen 0001 |
Optimal overlap representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), June 12-14, 1996, Beijing, China, pp. 8-14, 1996, IEEE Computer Society, 0-8186-7460-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
optimal overlap representations, minimal interval, circular arc overlap representations, minimal interval overlap representation, EREW PRAM processors, common CRCW PRAM, BSR processors, parallel algorithms, computational complexity, computational geometry, optimal algorithms |
32 | C. A. Johnson |
Computing Only Minimal Answers in Disjunctive Deductive Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 42(1), pp. 35-76, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Disjunctive deductive databases, Minimal answers, Perfect models, Disjunctive stable models, Cyclic sets, Strong covers, Database pre-processing, Compilation |
32 | Jie Zhou 0009, Duoqian Miao, Qinrong Feng, Lijun Sun |
Research on Complete Algorithms for Minimal Attribute Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, 4th International Conference, RSKT 2009, Gold Coast, Australia, July 14-16, 2009. Proceedings, pp. 152-159, 2009, Springer, 978-3-642-02961-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
minimal reduct, complete algorithm, decision table, discernibility function |
32 | Dongshu Yan, Jintao Zhang, Bo Yu 0003, Changtong Luo, Shaoliang Zhang |
A Genetic Algorithm for Finding Minimal Multi-homogeneous Bézout Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIS-ICIS ![In: 7th IEEE/ACIS International Conference on Computer and Information Science, IEEE/ACIS ICIS 2008, 14-16 May 2008, Portland, Oregon, USA, pp. 301-305, 2008, IEEE Computer Society, 978-0-7695-3131-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minimal multi-homogeneous Bezout number, genetic algorithm, heuristics, polynomial equations |
32 | Min Xie, Lixin Gao, Haiwa Guan |
Ant Algorithm Applied in the Minimal Cost Maximum Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 201-208, 2008, Springer, 978-3-540-85983-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minimal cost maximum flow problem, ant algorithm, directed network |
32 | Margreta Kuijper, Raquel Pinto |
Minimal Trellis Construction for Finite Support Convolutional Ring Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMCTA ![In: Coding Theory and Applications, Second International Castle Meeting, ICMCTA 2008, Castillo de la Mota, Medina del Campo, Spain, September 15-19, 2008. Proceedings, pp. 95-106, 2008, Springer, 978-3-540-87447-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
polynomial module, row reduced, p-generator sequence, minimal trellis, convolutional code, finite ring |
32 | Hans Kleine Büning, Xishun Zhao |
Extension and equivalence problems for clause minimal formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 43(1), pp. 295-306, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
clause minimal formulas, extension problem, complexity, equivalence problem |
32 | Martin Dietzfelbinger, Torben Hagerup |
Simple Minimal Perfect Hashing in Less Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 109-120, 2001, Springer, 3-540-42493-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
minimal perfect hash functions, space requirements, Data structures, randomized algorithms, hashing, dictionaries, hash tables |
32 | Chris J. Scheiman, Peter R. Cappello |
A Processor-Time-Minimal Systolic Array for Transitive Closure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 3(3), pp. 257-269, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
processor-time-minimal multiprocessor schedules, 2-D mesh, parallel algorithms, systolic array, systolic arrays, directed acyclic graph, multiprocessor schedule, transitive closure |
31 | Joseph Kaye |
I just clicked to say I love you: rich evaluations of minimal communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI Extended Abstracts ![In: Extended Abstracts Proceedings of the 2006 Conference on Human Factors in Computing Systems, CHI 2006, Montréal, Québec, Canada, April 22-27, 2006, pp. 363-368, 2006, ACM, 978-1-59593-298-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
minimal communication, minimal design, evaluation, bandwidth, intimacy |
31 | Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan |
An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 144-153, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
finite Abelian groups, minimal trellises, group code, minimal trellis, zero-divisors, submodule, p-linear combination, p-generator sequence, efficient algorithm, group theory, linear combination, cyclic groups |
31 | Augustus K. Uht |
A Theory of Reduced and Minimal Procedural Dependencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(6), pp. 681-692, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
reduced procedural dependencies, minimal procedural dependencies, reduced set, reduced data dependencies, minimal semantic dependencies, concurrency control, codes, instruction sets, reduced instruction set computing |
30 | Jeen-Shing Wang, Yen-Ping Chen |
A Hammerstein Recurrent Neurofuzzy Network With an Online Minimal Realization Learning Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Fuzzy Syst. ![In: IEEE Trans. Fuzzy Syst. 16(6), pp. 1597-1612, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Xibin Zhao, Kwok-Yan Lam, Guiming Luo, Siu Leung Chung, Ming Gu 0001 |
Minimal Threshold Closure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESORICS ![In: Computer Security - ESORICS 2006, 11th European Symposium on Research in Computer Security, Hamburg, Germany, September 18-20, 2006, Proceedings, pp. 145-155, 2006, Springer, 3-540-44601-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Threshold Closure, Access Control, Authorization, Threshold Schemes |
30 | Pinar Heggernes, Federico Mancini 0001 |
Minimal Split Completions of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 592-604, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Jie Wu 0001, Zhen Jiang |
Extended Minimal Routing in 2-D Meshes with Faulty Blocks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS Workshops ![In: 22nd International Conference on Distributed Computing Systems, Workshops (ICDCSW '02) July 2-5, 2002, Vienna, Austria, Proceedings, pp. 49-56, 2002, IEEE Computer Society, 0-7695-1588-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Paul Tarau, Brenda Luderman |
Exact combinational logic synthesis and non-standard circuit design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Conf. Computing Frontiers ![In: Proceedings of the 5th Conference on Computing Frontiers, 2008, Ischia, Italy, May 5-7, 2008, pp. 179-188, 2008, ACM, 978-1-60558-077-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
asymmetrical logic operators, exact combinational circuit synthesis, minimal transistor-count circuits, minimal universal boolean logic libraries |
30 | Marina Blanton, Mikhail J. Atallah |
Provable bounds for portable and flexible privacy-preserving access. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SACMAT ![In: 10th ACM Symposium on Access Control Models and Technologies, SACMAT 2005, Stockholm, Sweden, June 1-3, 2005, Proceedings, pp. 95-101, 2005, ACM, 1-59593-045-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
compact policy representation, minimal perfect hash functions, order-preserving minimal perfect hash functions, portable access rights, algorithm analysis |
29 | Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada |
Incremental Construction of Minimal Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 95-110, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Deterministic tree automata, Incremental construction of minimal tree automata |
29 | Morteza Esmaeili |
Construction of binary minimal product parity-check matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 19(4), pp. 339-348, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Minimal parity-check matrices, Product codes |
29 | Marije Kanis, Mark J. Perry, Willem-Paul Brinkman |
minimal connectedness: exploring the effects of positive messaging using mobile technology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI Extended Abstracts ![In: Extended Abstracts Proceedings of the 2008 Conference on Human Factors in Computing Systems, CHI 2008, Florence, Italy, April 5-10, 2008, pp. 2513-2522, 2008, ACM, 978-1-60558-012-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minimal connectedness, positive emotions, social sharing, social interaction, ambiguity, mobile technology |
29 | Zareen Alamgir, Sarmad Abbasi |
Combinatorial Algorithms for Listing Paths in Minimal Change Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAN ![In: Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers, pp. 112-130, 2007, Springer, 978-3-540-77293-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Minimal change order, Revolving door order, Generation of paths, Combinatorial algorithms, Complete graph |
29 | Jing Wang 0066, Ying Li, Xinmei Wang |
An Algorithm to Search Minimal Subtree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: 2007 International Conference on Parallel Processing Workshops (ICPP Workshops 2007), 10-14 September 2007, Xi-An, China, pp. 39, 2007, IEEE Computer Society, 978-0-7695-2934-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multicast routing graph, minimal subtree graph, information flow, network coding |
29 | Olivier Nempont, Jamal Atif, Elsa D. Angelini, Isabelle Bloch |
Combining Radiometric and Spatial Structural Information in a New Metric for Minimal Surface Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPMI ![In: Information Processing in Medical Imaging, 20th International Conference, IPMI 2007, Kerkrade, The Netherlands, July 2-6, 2007, Proceedings, pp. 283-295, 2007, Springer, 978-3-540-73272-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
• minimal surface segmentation • level sets • spatial relations • fuzzy knowledge representation |
29 | Yun Li, Zongtian Liu, Ling Chen, Wei Cheng, Cui-hua Xie |
Extracting Minimal Non-Redundant Association Rules from QCIL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: 2004 International Conference on Computer and Information Technology (CIT 2004), 14-16 September 2004, Wuhan, China, pp. 986-991, 2004, IEEE Computer Society, 0-7695-2216-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Minimal non-redundant rule, Quantitative closed itemset lattice, Association rule, Frequent closed itemset |
29 | Maria J. García de la Banda, Peter J. Stuckey, Jeremy Wazny |
Finding all minimal unsatisfiable subsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 27-29 August 2003, Uppsala, Sweden, pp. 32-43, 2003, ACM, 1-58113-705-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
minimal unsatisfiable subsets, constraint solving |
29 | Markus Bläser |
Algebras of Minimal Rank over Perfect Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 113-122, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
algebras of minimal rank, multiplication, bilinear complexity |
29 | Philippe Baldy, Michel Morvan |
Height Preserving Minimal Interval Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 18(1), pp. 69-77, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
lattice of maximal antichains, minimal interval extensions, lattices, partially ordered sets, interval orders, height |
29 | Chen Sagiv, Nir A. Sochen, Yehoshua Y. Zeevi |
Gabor Feature Space Diffusion via the Minimal Weighted Area Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMMCVPR ![In: Energy Minimization Methods in Computer Vision and Pattern Recognition, Third International Workshop, EMMCVPR 2001, Sophia Antipolis, France, September 3-5, 2001, Proceedings, pp. 621-635, 2001, Springer, 3-540-42523-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Gabor analysis, Geometric-based algorithms, Beltrami framework, image manifolds, minimal weighted area method, Anisotropic diffusion, Geodesic active contours |
29 | Heejong Suh, Carl K. Chang |
Algorithms for the Minimal Cutsets Enumeration of Networks by Graph Search and Branch Addition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: Proceedings 27th Conference on Local Computer Networks, Tampa, Florida, USA, 8-10 November, 2000, pp. 100-107, 2000, IEEE Computer Society, 0-7695-0912-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
minimal cutsets enumeration, branch addition, graph method, graph tree, sub-vertex set, graph topology, disjoint vertex set, algorithms, computational complexity, reliability, reliability, networks, graph theory, network topology, time complexity, spanning tree, binary tree, graph search |
29 | Anne Berry, Jean Paul Bordat, Olivier Cogis |
Generating All the Minimal Separators of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 167-172, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Minimal Separator, Graph, Enumeration Algorithm |
29 | Ivo G. Rosenberg, Hajime Machida |
Gigantic Pairs of Minimal Clones. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 29th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1999, Freiburg im Breisgau, Germany, May 20-22, 1999, Proceedings, pp. 74-79, 1999, IEEE Computer Society, 0-7695-0161-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
minimal clone, primal algebra, clone |
29 | Hans Kleine Büning |
An Upper Bound for Minimal Resolution Refutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 171-178, 1998, Springer, 3-540-65922-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
propositional formulas, length of proofs, minimal unsatisfiability, resolution |
28 | Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov |
Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 15th IAPR International Conference, DGCI 2009, Montréal, Canada, September 30 - October 2, 2009. Proceedings, pp. 337-349, 2009, Springer, 978-3-642-04396-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
digital object connectivity, curve offset, Digital geometry, digital curve |
28 | T. Yung Kong |
Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 13th International Conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006, Proceedings, pp. 169-188, 2006, Springer, 3-540-47651-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Zuoquan Lin, Wei Li 0022 |
On Logic of Paradox. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 25th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1995, Bloomington, Indiana, USA, May 23-25, 1995, Proceedings, pp. 248-255, 1995, IEEE Computer Society, 0-8186-7118-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
logic of paradox, minimal semantics, satisfactory proof theory, signed tableaux, completeness theorems, theorem proving, soundness, nonmonotonic reasoning, proof theory, paraconsistent logic, nonmonotonicity |
27 | B. Bodenstorfer |
Short Communication/Kureze Mitteilung. How many Minimal Upper Bounds of Minimal Upper Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 56(2), pp. 173-178, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Subset-relation, minimal upper bound, generalized induction, nonmonotonic logic |
27 | Daniel Meister 0001 |
A Characterisation of the Minimal Triangulations of Permutation Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 99-108, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger |
Characterizing Minimal Interval Completions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 236-247, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Scott J. Weber, Kurt Keutzer |
Using minimal minterms to represent programmability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CODES+ISSS ![In: Proceedings of the 3rd IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis, CODES+ISSS 2005, Jersey City, NJ, USA, September 19-21, 2005, pp. 63-68, 2005, ACM, 1-59593-161-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Boolean function representation, instruction set extraction, Boolean satisfiability |
27 | Jacob Feldman |
Perceptual Grouping by Selection of a Logically Minimal Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 55(1), pp. 5-25, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
nonaccidental properties, logic, perceptual grouping, perceptual organization |
27 | Giacomino Veltri, Qingfeng Huang, Gang Qu 0001, Miodrag Potkonjak |
Minimal and maximal exposure path algorithms for wireless embedded sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SenSys ![In: Proceedings of the 1st International Conference on Embedded Networked Sensor Systems, SenSys 2003, Los Angeles, California, USA, November 5-7, 2003, pp. 40-50, 2003, ACM, 1-58113-707-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
centralized optimal algorithms, wireless embedded sensor networks, simulation, localized algorithms |
27 | Fredrik Kahl, Anders Heyden, Long Quan |
Minimal Projective Reconstruction Including Missing Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 23(4), pp. 418-424, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
structure from motion, missing data, projective geometry, projective reconstruction, Structure recovery |
27 | Jie Wu 0001 |
A Fault-Tolerant Adaptive and Minimal Routing Approach in n-D Meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: Proceedings of the 2000 International Conference on Parallel Processing, ICPP 2000, Toronto, Canada, August 21-24, 2000, pp. 431-438, 2000, IEEE Computer Society, 0-7695-0768-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Long Quan, Anders Heyden, Fredrik Kahl |
Minimal Projective Reconstruction with Missing Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 1999 Conference on Computer Vision and Pattern Recognition (CVPR '99), 23-25 June 1999, Ft. Collins, CO, USA, pp. 2210-2216, 1999, IEEE Computer Society, 0-7695-0149-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
26 | Seungjae Lee 0001, Changhwa Kim, Sangkyung Kim |
Constructing Energy Efficient Wireless Sensor Networks by Variable Transmission Energy Level Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: Sixth International Conference on Computer and Information Technology (CIT 2006), 20-22 September 2006, Seoul, Korea, pp. 225, 2006, IEEE Computer Society, 0-7695-2687-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
minimal energy transmission, energy-minimal routing path, constructing network, wireless sensor network, energy efficiency |
26 | Guantao Chen, Frank J. Hall, Zhongshan Li, Bing Wei 0001 |
On Ranks of Matrices Associated with Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 19(3), pp. 323-334, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Sign pattern matrix, Symmetric tree sign pattern, Minimal rank, Symmetric minimal rank |
26 | Benjamin T. Fine |
Unsupervised anomaly detection with minimal sensing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 47th Annual Southeast Regional Conference, 2009, Clemson, South Carolina, USA, March 19-21, 2009, 2009, ACM, 978-1-60558-421-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
clustering, anomaly detection, unsupervised learning, minimal spanning tree |
26 | Haytham Elghazel, Khalid Benabdeslem, Hamamache Kheddouci |
McSOM: Minimal Coloring of Self-Organizing Map. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, 5th International Conference, ADMA 2009, Beijing, China, August 17-19, 2009. Proceedings, pp. 128-139, 2009, Springer, 978-3-642-03347-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
minimal coloring, neighborhood relations, clustering, Self-organizing map |
26 | Mark H. Liffiton, Karem A. Sakallah |
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 40(1), pp. 1-33, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Minimal unsatifiable subset, CAMUS, Constraint satisfaction |
26 | Federica Paci, David Bauer, Elisa Bertino, Douglas M. Blough, Anna Cinzia Squicciarini |
Minimal credential disclosure in trust negotiations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Digital Identity Management ![In: Proceedings of the 4th Workshop on Digital Identity Management, Alexandria, VA, USA, October 31, 2008, pp. 89-96, 2008, ACM, 978-1-60558-294-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
identity attributes, micro-claims, minimal disclosure |
26 | Bastian Goldlücke, Ivo Ihrke, Christian Linz, Marcus A. Magnor |
Weighted Minimal Hypersurface Reconstruction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 29(7), pp. 1194-1208, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Weighted minimal hypersurfaces, Euler-Lagrange formulation, reconstruction, tomography |
26 | Bernardo Cockburn, Bo Dong |
An Analysis of the Minimal Dissipation Local Discontinuous Galerkin Method for Convection-Diffusion Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sci. Comput. ![In: J. Sci. Comput. 32(2), pp. 233-262, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Minimal dissipation local discontinuous Galerkin method, convection-diffusion equation |
26 | Kumar Chellapilla, Anton Mityagin, Denis Xavier Charles |
GigaHash: scalable minimal perfect hashing for billions of urls. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 16th International Conference on World Wide Web, WWW 2007, Banff, Alberta, Canada, May 8-12, 2007, pp. 1165-1166, 2007, ACM, 978-1-59593-654-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
minimal perfect hashing, space efficient hash table, web search engine, perfect hash function |
26 | Rongfang Bie, Guohua Wu |
A Minimal Pair in the Quotient Structure M / NCup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 53-62, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Computably enumerable degrees, quotient structure, minimal pairs |
26 | Yu Hu 0002, Tong Jing, Zhe Feng 0002, Xianlong Hong, Xiaodong Hu 0001, Guiying Yan |
ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 21(1), pp. 147-152, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
rectilinear Steiner minimal tree (RSMT), routing, physical design, ant colony optimization (ACO) |
26 | Fabio Massacci, John Mylopoulos, Nicola Zannone |
Hierarchical hippocratic databases with minimal disclosure for virtual organizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 15(4), pp. 370-387, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Minimal disclosure, Private data management, Access control, Information security, Virtual organizations, Delegation, Privacy protection |
26 | Guoliang Xu, Qin Zhang 0005 |
Minimal Mean-Curvature-Variation Surfaces and Their Applications in Surface Modeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Geometric Modeling and Processing - GMP 2006, 4th International Conference, Pittsburgh, PA, USA, July 26-28, 2006, Proceedings, pp. 357-370, 2006, Springer, 3-540-36711-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Minimal mean-curvature-variation flow, Discretization, Surface modeling, Energy functional, Euler-Lagrange equation |
26 | Roberto Ardon, Laurent D. Cohen, Anthony J. Yezzi |
A New Implicit Method for Surface Segmentation by Minimal Paths: Applications in 3D Medical Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMMCVPR ![In: Energy Minimization Methods in Computer Vision and Pattern Recognition, 5th International Workshop, EMMCVPR 2005, St. Augustine, FL, USA, November 9-11, 2005, Proceedings, pp. 520-535, 2005, Springer, 3-540-30287-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Stationary Transport Equation, Image segmentation, Active contours, Level Set method, Object Extraction, Minimal Paths |
26 | Sudeshna Dasgupta, Vijay Chandru |
Minimal Unsatisfiable Sets: Classification and Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIAN ![In: Advances in Computer Science - ASIAN 2004, Higher-Level Decision Making, 9th Asian Computing Science Conference, Dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday, Chiang Mai, Thailand, December 8-10, 2004, Proceedings, pp. 330-342, 2004, Springer, 3-540-24087-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Minimal Unsatisfiable Sets, satisfiability, propositional logic, Boolean formulas |
26 | Chyi-Jou Gau, T. Yung Kong |
4D Minimal Non-simple Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 10th International Conference, DGCI 2002, Bordeaux, France, April 3-5, 2002, Proceedings, pp. 81-91, 2002, Springer, 3-540-43380-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
4D xel, minimal non-simple, MNS, attachment, parallel thinning |
26 | Brett McElwee |
Maximal and Minimal Semilattices on Ordered Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 18(2), pp. 137-149, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
free, filter, minimal, ideal, semilattice, maximal |
26 | Paul LaFollette, James F. Korsh |
A Loopless Algorithm for Generation of Basic Minimal Interval Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 17(3), pp. 271-285, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
loopless algorithm, minimal, interval order |
26 | Irith Pomeranz, Sudhakar M. Reddy |
On Finding a Minimal Functional Description of a Finite-State Machine for Test Generation for Adjacent Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 49(1), pp. 88-94, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
minimal descriptions, test generation, Finite-state machines |
26 | Thomas Deschamps, Laurent D. Cohen |
Minimal Paths in 3D Images and Application to Virtual Endoscopy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (2) ![In: Computer Vision - ECCV 2000, 6th European Conference on Computer Vision, Dublin, Ireland, June 26 - July 1, 2000, Proceedings, Part II, pp. 543-557, 2000, Springer, 3-540-67686-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Medical image understanding, Deformable Models, Level Set methods, Minimal paths, Fast Marching, Eikonal Equation |
26 | Vicent Caselles, Ron Kimmel, Guillermo Sapiro, Catalina Sbert |
Minimal Surfaces Based Object Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 19(4), pp. 394-398, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
mean curvature motion, medical images, deformable models, 3D segmentation, minimal surfaces |
26 | Fabrizio Petrini, Marco Vanneschi |
Performance Analysis of Minimal Adaptive Wormhole Routing with Time-Dependent Deadlock Recovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: 11th International Parallel Processing Symposium (IPPS '97), 1-5 April 1997, Geneva, Switzerland, Proceedings, pp. 589-, 1997, IEEE Computer Society, 0-8186-7792-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
minimal adaptive wormhole routing, potential deadlocks, performance analysis, multiprocessor interconnection networks, virtual channels, deadlock avoidance, timeout, deadlock recovery |
26 | Laurent D. Cohen, Ron Kimmel |
Global Minimum for Active Contour Models: A Minimal Path Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96), June 18-20, 1996 San Francisco, CA, USA, pp. 666-673, 1996, IEEE Computer Society, 0-8186-7258-7. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Deformable Models-Snakes, Path of minimal cost, Feature Extraction, Segmentation, Partial Differential Equations, Level Sets, Energy Minimization, Shape modeling |
26 | Eun-Hee Hyun, Sung-Hee Kim |
Real-time mobile data management using a minimal MMDB. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 2nd International Workshop on Real-Time Computing Systems and Applications, October 25 - 27, 1995, Tokyo, Japan, pp. 125-, 1995, IEEE Computer Society, 0-8186-7106-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
real-time mobile data management, minimal MMDB, main memory database system, mobile computational viewpoint, location registers, fast access methods, digital cellular system, real-time systems, middleware, database management systems, relational data model, client/server architecture, design considerations |
26 | Chao-Chih Yang, Jennifer Jau-Yin Chen, H. Lewis Chau |
Algorithms for Constructing Minimal Deduction Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(6), pp. 760-770, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
MDG construction algorithms, Hern clauses, minimal deduction graphs, Horn clause logic, DG, Horn formulas, positive literals, rule instances, tree space, logic programming, graphs, expert systems, inference mechanisms, transitivity, backtracking, inference rules, reflexivity, arcs, sink, subtrees, HF |
26 | Hans-Jürgen Bandelt |
Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings, pp. 1-7, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
26 | Augusto Ciuffoletti |
Self-stabilization - beyond the token ring circulation (brief announcement). ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, July 16-19, 2000, Portland, Oregon, USA., pp. 333, 2000, ACM, 1-58113-183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Pham Ngoc Hung, Toshiaki Aoki, Takuya Katayama |
A Minimized Assumption Generation Method for Component-Based Software Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2009, 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009. Proceedings, pp. 277-291, 2009, Springer, 978-3-642-03465-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
minimal assumption, model checking, learning algorithm, modular verification, assume-guarantee reasoning |
24 | Guillaume Damiand, Samuel Peltier, Laurent Fuchs |
Computing Homology for Surfaces with Generalized Maps: Application to 3D Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISVC (2) ![In: Advances in Visual Computing, Second International Symposium, ISVC 2006 Lake Tahoe, NV, USA, November 6-8, 2006. Proceedings, Part II, pp. 235-244, 2006, Springer. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
homology generators, minimal subdivision, generalized maps, topological features |
Displaying result #1 - #100 of 18931 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|