The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for complexities with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1958-1976 (17) 1977-1983 (16) 1984-1986 (15) 1987-1988 (25) 1989 (18) 1990 (16) 1991 (22) 1992 (23) 1993 (19) 1994 (20) 1995 (36) 1996 (32) 1997 (34) 1998 (34) 1999 (59) 2000 (67) 2001 (84) 2002 (103) 2003 (110) 2004 (141) 2005 (186) 2006 (237) 2007 (254) 2008 (207) 2009 (153) 2010 (49) 2011 (23) 2012 (21) 2013 (24) 2014 (30) 2015 (41) 2016 (33) 2017 (32) 2018 (29) 2019 (34) 2020 (35) 2021 (50) 2022 (57) 2023 (52) 2024 (20)
Publication types (Num. hits)
article(828) book(4) incollection(12) inproceedings(1603) phdthesis(11)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2394 occurrences of 1655 keywords

Results
Found 2458 publication records. Showing 2458 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
16Tim Blackmore, Graham H. Norton On a family of Abelian codes and their state complexities. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
16Yuri Kalnishkan, Michael V. Vyugin, Volodya Vovk Loss Functions, Complexities, and the Legendre Transformation. Search on Bibsonomy ALT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
16Danail Bonchev Overall Connectivities/Topological Complexities: A New Powerful Tool for QSPR/QSAR. Search on Bibsonomy J. Chem. Inf. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
16Aviezri S. Fraenkel Recent results and questions in combinatorial game complexities. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
16Michael V. Vyugin Information Distance and Conditional Complexities Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2000 DBLP  BibTeX  RDF
16Marcella A. McClure The complexities of genome analysis, the Retroid agent perspective. Search on Bibsonomy Bioinform. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
16Ronald de Wolf Nondeterministic Quantum Query and Quantum Communication Complexities Search on Bibsonomy CoRR The full citation details ... 2000 DBLP  BibTeX  RDF
16Tetsuo Asano, Yasuyuki Kawamura Algorithmic considerations on the computational complexities of digital line extraction problem. Search on Bibsonomy Syst. Comput. Jpn. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
16Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. Search on Bibsonomy SWAT The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
16Christophe Fiorio, Richard Nock A Concentration-Based Adaptive Approach to Region Merging of Optimal Time and Space Complexities. Search on Bibsonomy BMVC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
16Shih Ping Tung Sentences over Integral Domains and Their Computational Complexities. Search on Bibsonomy Inf. Comput. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
16Jack Halpern, Jouni Kerman The pitfalls and complexities of Chinese to Chinese conversion. Search on Bibsonomy MTSummit The full citation details ... 1999 DBLP  BibTeX  RDF
16Catherine H. Gebotys, Robert J. Gebotys Complexities in DSP Software Compilation: Performance, Code Size Power, Retargetability. Search on Bibsonomy HICSS (3) The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
16Piotr Berman, Bhaskar DasGupta Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems. Search on Bibsonomy Algorithmica The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
16Jia-Yin Wang, Mao-Chao Lin On constructing trellis codes with large free distances and low decoding complexities. Search on Bibsonomy IEEE Trans. Commun. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
16Eliezer Kantorowitz On Implementation and Extension Complexities. Search on Bibsonomy ECOOP Workshops The full citation details ... 1997 DBLP  BibTeX  RDF
16Kim Clohessy, Brian M. Barry, Peter Tanner New Complexities in the Embedded World - The OTI Approach. Search on Bibsonomy ECOOP Workshops The full citation details ... 1997 DBLP  BibTeX  RDF
16Martin Zahn, Walter Hower Backtracking along with constraint processing and their time complexities. Search on Bibsonomy J. Exp. Theor. Artif. Intell. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
16David J. Evans 0001, A. A. Al-Wali A comparison of the computatlonal complexities of the stride reduction methods. Search on Bibsonomy Int. J. Comput. Math. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
16Vladimir A. Uspensky, Alexander Shen Relations Between Varieties of Kolmogorov Complexities. Search on Bibsonomy Math. Syst. Theory The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
16Robert H. Dolin Model Formulation: Modeling the Temporal Complexities of Symptoms. Search on Bibsonomy J. Am. Medical Informatics Assoc. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
16Mikhail Y. Kovalyov Improving the complexities of approximation algorithms for optimization problems. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
16Vince Grolmusz Separating the Communication Complexities of MOD m and MOD p Circuits. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
16James P. Jones, Aviezri S. Fraenkel Complexities of Winning Strategies in Diophantine Games. Search on Bibsonomy J. Complex. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
16J. D. Annan The Complexities of the Coefficients of the Tutte Polynomial. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
16Joel I. Seiferas, Albert R. Meyer Characterizations of Realizable Space Complexities. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
16Volker Strehl, Herbert S. Wilf Five Surprisingly Simple Complexities. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
16Michael Paterson Overcoming Copyright and Other Intellectual Property Complexities and Protecting and Exploiting Intellectual Property Rights in Museums. Search on Bibsonomy ICHIM, Hands on: Hypermedia and Interactivity in Museums The full citation details ... 1995 DBLP  BibTeX  RDF
16Jeff Erickson 0001 On the relative complexities of some geometric problems. Search on Bibsonomy CCCG The full citation details ... 1995 DBLP  BibTeX  RDF
16Andrew G. Dempster, Malcolm D. Macleod Comparison of IIR Filter Structure Complexities Using Multiplier Blocks. Search on Bibsonomy ISCAS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
16Sheng Yu 0001, Qingyu Zhuang, Kai Salomaa The State Complexities of Some Basic Operations on Regular Languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
16Boris Aronov, Jirí Matousek 0001, Micha Sharir On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1994 DBLP  BibTeX  RDF
16Kouji Miura, Toshimitsu Masuzawa, Nobuki Tokura A distributed shortest-paths algorithm with distance-dependent message complexities. Search on Bibsonomy Syst. Comput. Jpn. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
16Mengxiong Liu Progress in Documentation the Complexities of citation Practice: a Review of citation studies. Search on Bibsonomy J. Documentation The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
16Markus Holzer 0001, Klaus-Jörn Lange On the Complexities of Linear LL(1) and LR(1) Grammars. Search on Bibsonomy FCT The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
16Mai-Huong Nguyen, Mischa Schwartz Reducing the Complexities of TCP for a High Speed Networking Environment. Search on Bibsonomy INFOCOM The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
16Hosame Abu-Amara, Arkady Kanevsky On the Complexities of the Leader Election Algorithms. Search on Bibsonomy ICCI The full citation details ... 1993 DBLP  BibTeX  RDF
16Thomas Lengauer, Klaus W. Wagner The Correlation between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
16Bonnie S. Dunbar Post-translational Modification of Proteins: Complexities of Analysis of Structure and Function. Search on Bibsonomy Comput. Chem. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
16Elmar Eder Relative complexities of first order calculi. Search on Bibsonomy 1992   RDF
16Lei Xu 0001, Erkki Oja Further developments on RHT: basic mechanisms, algorithms, and computational complexities. Search on Bibsonomy ICPR (1) The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
16Sheng Yu 0001, Qingyu Zhuang, Kai Salomaa Obtaining Tight Upper Bounds for the State Complexities of DFA Operations. Search on Bibsonomy ICCI The full citation details ... 1992 DBLP  BibTeX  RDF
16Mokhtar Aboelaze, Benjamin W. Wah Complexities of layouts in three-dimensional VLSI circuits. Search on Bibsonomy Inf. Sci. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
16Philip J. Smith, Deb Galdes, Jane M. Fraser, Thomas Miller, Jack W. Smith, John R. Svirbely, Janice Blazina, Melanie Kennedy, Sally Rudmann, Donna L. Thomas Coping with the Complexities of Multiple-Solution Problems: A Case Study. Search on Bibsonomy Int. J. Man Mach. Stud. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
16Boris Aronov, Jirí Matousek 0001, Micha Sharir On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. Search on Bibsonomy SCG The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
16Chandan Haldar, Lalit M. Patnaik Oracle Complexities for Computational Geometry of Semi-Algebraic Sets and Voronoi Diagrams. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
16Andrzej Szepietowski If Deterministic and Nondeterministic Space Complexities are Equal for log log n, then they are also Equal for log n. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
16Ferng-Ching Lin, Jiann-Cherng Shish Space and time complexities of balanced sorting on processor arrays. Search on Bibsonomy J. Complex. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
16Harlan D. Webre Compromises and complexities associated with removal of MIS from the logical access authorization loop. Search on Bibsonomy ACM Southeast Regional Conference The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
16Y. C. Chen, Z. C. Yen, G. H. Chen Using Fewer Processors to Reduce Time Complexities of Semigroup Computations. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
16Gerd Baron, Friedrich J. Urbanek Factorial Languages with Quadratically Upper Bounded Growth Functions and Nonlinearly Upper Bounded Subword Complexities. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
16Efstratios Gallopoulos, Yousef Saad Some Fast Elliptic Solvers on Parallel Architectures and their Complexities. Search on Bibsonomy Int. J. High Speed Comput. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
16Andrzej Szepietowski If Deterministic and Nondeterministic Space Complexities are Equal for log log n then they are also Equal for log n. (journal version: Theor. Comput. Sci. 74(1): 115-119(1990)) Search on Bibsonomy STACS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
16Patrick O. Bobbie, Joseph E. Urban A model for understanding complexities of developing large-scale software systems. Search on Bibsonomy TAI The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
16Yen-Cheng Chen, Wen-Tsuen Chen, Gen-Huey Chen, Jang-Ping Sheu Reducing Time Complexities of Semigroup Computations on Mesh-Connected Computers with Multiple Broadcasting. Search on Bibsonomy ICPP (3) The full citation details ... 1989 DBLP  BibTeX  RDF
16David V. Chudnovsky, Gregory V. Chudnovsky Algebraic complexities and algebraic curves over finite fields. Search on Bibsonomy J. Complex. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
16Richard T. C. Kwok, Maurice Beale Aperiodic Linear Complexities of de Bruijn Sequences. Search on Bibsonomy CRYPTO The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
16Sang-Bum Lee, Hanan Luss Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities. Search on Bibsonomy Oper. Res. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
16John Shawe-Taylor Information and its Relation to Formalisms for the Complexities of the Real World. Search on Bibsonomy J. Inf. Technol. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
16Shih Ping Tung Computational Complexities of Diophantine Equations with Parameters. Search on Bibsonomy J. Algorithms The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
16Harald Ganzinger Completion with History-Dependent Complexities for Generated Equations. Search on Bibsonomy ADT The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
16Jean-Jacques Pansiot Subword complexities and iteration. Search on Bibsonomy Bull. EATCS The full citation details ... 1985 DBLP  BibTeX  RDF
16Baruch Awerbuch Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization. Search on Bibsonomy Networks The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
16B. A. Rich From the history and basics of chip design to mystical complexities of bit-sliced architecture: N A Alexandridis 'Microprocessor system design concepts' Computer Science (1984) $32.95 pp 623. Search on Bibsonomy Microprocess. Microsystems The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
16Bernard Nudel Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory-Based Heuristics. Search on Bibsonomy Artif. Intell. The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
16Patrick Shen-Pei Wang Hierarchical Structures and Complexities of Parallel Isometric Languages. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
16Victor Y. Pan The Additive and Logical Complexities of Linear and Bilinear Arithmetic Algorithms. Search on Bibsonomy J. Algorithms The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
16Bernard Nudel Solving the General Consistent Labeling (or Constraint Satisfaction) Problem: Two Algorithms and Their Expected Complexities. Search on Bibsonomy AAAI The full citation details ... 1983 DBLP  BibTeX  RDF
16Egbert Creutzburg Complexities of Quadtrees and the Structure of Pictures. Search on Bibsonomy J. Inf. Process. Cybern. The full citation details ... 1982 DBLP  BibTeX  RDF
16Andrzej Ehrenfeucht, Grzegorz Rozenberg On Subword Complexities of Homomorphic Images of Languages. Search on Bibsonomy RAIRO Theor. Informatics Appl. The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
16Agnes Hui Chan, Richard A. Games, Edwin L. Key On the Complexities of de Bruijn Sequences. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
16Gerd Wechsung, Andreas Brandstädt A Relation Between Space, Return and Dual Return Complexities. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
16Tso-Kai Liu Synthesis of Feed-Forward MOS Networks with Cells of Similar-Complexities. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1977 DBLP  DOI  BibTeX  RDF MOS complex cell, negative function, optimal feed-forward network, Boolean expression, cell complexity, input vector
16Charles M. Fiduccia, Yechezkel Zalcstein Algebras Having Linear Multiplicative Complexities. Search on Bibsonomy J. ACM The full citation details ... 1977 DBLP  DOI  BibTeX  RDF Ada
16Michal Chytil Comparison of the Active Visiting and the Crossing Complexities. Search on Bibsonomy MFCS The full citation details ... 1977 DBLP  DOI  BibTeX  RDF
16Eiichi Goto, Yasumasa Kanada Hashing LEMMAs on time complexities with applications to formula manipulation. Search on Bibsonomy SYMSACC The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
16Kai Hwang 0001 Some structural complexities of time-varying sequential machines. Search on Bibsonomy Int. J. Parallel Program. The full citation details ... 1975 DBLP  DOI  BibTeX  RDF
16Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg Subword complexities of various classes of deterministic developmental languages with interactions. Search on Bibsonomy Int. J. Parallel Program. The full citation details ... 1975 DBLP  DOI  BibTeX  RDF
16Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1975 DBLP  DOI  BibTeX  RDF
16David E. Muller, Franco P. Preparata Bounds to Complexities of Networks for Sorting and for Switching. Search on Bibsonomy J. ACM The full citation details ... 1975 DBLP  DOI  BibTeX  RDF
16Oscar H. Ibarra A Note Concerning Nondeterministic Tape Complexities. Search on Bibsonomy J. ACM The full citation details ... 1972 DBLP  DOI  BibTeX  RDF
16Walter J. Savitch Relationships Between Nondeterministic and Deterministic Tape Complexities. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1970 DBLP  DOI  BibTeX  RDF
16John E. Hopcroft, Jeffrey D. Ullman Relations Between Time and Tape Complexities. Search on Bibsonomy J. ACM The full citation details ... 1968 DBLP  DOI  BibTeX  RDF
13Benoît Hudson, Gary L. Miller, Steve Oudot, Donald R. Sheehy Topological inference via meshing. Search on Bibsonomy SCG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF sparse voronoi refinement, mesh generation, persistent homology, topological inference
13Azzedine Boukerche, Kaouther Abrougui, Richard Werner Nelem Pazzi Context-aware and location-based service discovery protocol for vehicular networks. Search on Bibsonomy PE-WASUN The full citation details ... 2009 DBLP  DOI  BibTeX  RDF location-based services, service discovery, vehicular networks
13Srinath Perera, Suresh Marru, Thilina Gunarathne, Dennis Gannon, Beth Plale Application of Management Frameworks to Manage Workflow-Based Systems: A Case Study on a Large Scale E-science Project. Search on Bibsonomy ICWS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
13Galina Jirásková Concatenation of Regular Languages and Descriptional Complexity. Search on Bibsonomy CSR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
13Mohamed E. Hussein 0001, Wael Abd-Almageed Approximate kernel matrix computation on GPUs forlarge scale learning applications. Search on Bibsonomy ICS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF kernel methods, sparse matrices, space filling curves, gpu, affinity propagation
13Yu Sasaki, Kazumaro Aoki Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others. Search on Bibsonomy ACISP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF RIPEMD, double branch, preimage, meet-in-the-middle
13Orr Dunkelman, Nathan Keller Cryptanalysis of CTC2. Search on Bibsonomy CT-RSA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
13Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri Brief announcement: low depth cache-oblivious sorting. Search on Bibsonomy SPAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF schedulers, parallel algorithms, multiprocessors, sorting, merging, cache-oblivious algorithms
13Milos Milovanovic, Roger Ferrer, Vladimir Gajinov, Osman S. Unsal, Adrián Cristal, Eduard Ayguadé, Mateo Valero Nebelung: Execution Environment for Transactional OpenMP. Search on Bibsonomy Int. J. Parallel Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Compiler, OpenMP, Software Transactional Memory, Runtime system
13Guoan Bi, Yingtuo Ju, Xiumei Li Fast Algorithms for Polynomial Time-Frequency Transforms of Real-Valued Sequences. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
13Ales Plsek, Philippe Merle, Lionel Seinturier A Real-Time Java Component Model. Search on Bibsonomy ISORC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF real-time architecture design, component model, Real-time Java, RTSJ
13Nao Hirokawa, Georg Moser Complexity, Graphs, and the Dependency Pair Method. Search on Bibsonomy LPAR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
13Seiya Miyazaki, Nancy R. Mead, Justin Zhan Computer-Aided Privacy Requirements Elicitation Technique. Search on Bibsonomy APSCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
13Cyril Allauzen, Mehryar Mohri, Ashish Rastogi General Algorithms for Testing the Ambiguity of Finite Automata. Search on Bibsonomy Developments in Language Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
13Rosa R. Heckle, Wayne G. Lutters, David Gurzick Network authentication using single sign-on: the challenge of aligning mental models. Search on Bibsonomy CHIMIT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF security, human factors, management, mental models, SSO
13Christine Reidl, Marianne Tolar, Ina Wagner Impediments to change: the case of implementing an electronic patient record in three oncology clinics. Search on Bibsonomy PDC The full citation details ... 2008 DBLP  BibTeX  RDF implementation, participation, change management, electronic patient record, organizational issues
13Minhua Li, Chunheng Wang An adaptive text detection approach in images and video frames. Search on Bibsonomy IJCNN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
Displaying result #701 - #800 of 2458 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license