|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3546 occurrences of 2220 keywords
|
|
|
Results
Found 8751 publication records. Showing 8751 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
14 | Andrea Balluchi, Luca Benvenuti, Maria Domenica Di Benedetto, Guido M. Miconi, Ugo Pozzi, Tiziano Villa, Howard Wong-Toi, Alberto L. Sangiovanni-Vincentelli |
Maximal Safe Set Computation for Idle Speed Control of an Automotive Engine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 23-25, 2000, Proceedings, pp. 32-44, 2000, Springer, 3-540-67259-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
14 | Sayaka Nagai, Shin-Ichi Nakano |
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 290-301, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
14 | Lucien Haddad, Hajime Machida, Ivo G. Rosenberg |
On the Intersection of Maximal Partial Clones and the Join of Minimal Partial Clones. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 30th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2000, Portland, Oregon, USA, May 23-25, 2000, Proceedings, pp. 396-401, 2000, IEEE Computer Society, 0-7695-0692-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
14 | Siu-Cheung Chau, Ada Wai-Chee Fu |
A Gracefully Degradable Declustered RAID Architecture with near Optimal Maximal Read and Write Parallelism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLUSTER ![In: 2000 IEEE International Conference on Cluster Computing (CLUSTER 2000), November 28th - December 1st, 2000, Technische Universität Chemnitz, Saxony, Germany, pp. 309-318, 2000, IEEE Computer Society, 0-7695-0896-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Declustered RAID, Fault-Tolerant, RAID, Disk Arrays |
14 | Guido Proietti |
An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 36(4), pp. 257-266, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
14 | Bernhard von Stengel |
New Maximal Numbers of Equilibria in Bimatrix Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 21(4), pp. 557-568, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
14 | Mieczyslaw Jessa |
Maximal cycle length of pseudochaotic sequences generated by piecewise linear maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (5) ![In: Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30 - June 2, 1999, pp. 450-453, 1999, IEEE, 0-7803-5471-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
14 | Holger Hermanns, Markus Lohrey |
Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR '98: Concurrency Theory, 9th International Conference, Nice, France, September 8-11, 1998, Proceedings, pp. 237-252, 1998, Springer, 3-540-64896-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
14 | M. Manzur Murshed, Richard P. Brent |
Constant Time Algorithms for Computing the Contour of Maximal Elements on the Reconfigurable Mesh. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 11-13 December 1997, Seoul, Korea, Proceedings, pp. 172-177, 1997, IEEE Computer Society, 0-8186-8227-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Parallel algorithm, Computational geometry, Reconfigurable mesh |
14 | Tetsuya Murai, Akihiro Kitada, Yoshiharu Sato |
Generation of fuzzy k-partitions based on tolerance relations and maximal consistency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (2) ![In: Knowledge-Based Intelligent Electronic Systems, 1st International Conference, KES 1997, Adelaide, South Australia, 21-23 May, 1997, Proceedings, Part II, pp. 378-382, 1997, IEEE. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
14 | Christian Dufaza, Hassan Ihs |
Test Synthesis for DC Test and Maximal Diagnosis of Switched-Capacitor Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 15th IEEE VLSI Test Symposium (VTS'97), April 27-May 1, 1997, Monterey, California, USA, pp. 252-260, 1997, IEEE Computer Society, 0-8186-7810-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
14 | Wun-Seng Chou |
On inversive maximal period polynomials over finite fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 6(4/5), pp. 245-250, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Pseudorandon Number, Recurring Sequence, Finite Field, Polynomial |
14 | Bernhard Nebel, Hans-Jürgen Bürckert |
Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 42(1), pp. 43-66, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
constraint satisfaction, temporal reasoning, qualitative reasoning, interval algebra |
14 | Wen-Lian Hsu |
A Linear Time Algorithm For Finding Maximal Planar Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings, pp. 352-361, 1995, Springer, 3-540-60573-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
14 | Imre Bárány, Herbert E. Scarf, David Shallcross |
The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 244-251, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
14 | Zhi-Zhong Chen |
NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings, pp. 99-110, 1995, Springer, 3-540-60084-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
14 | Pierre Brémaud |
Maximal coupling and rare perturbation sensitivity analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 11(4), pp. 307-333, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
simulation, Sensitivity analysis, perturbation analysis, point processes, likelihood ratio, discrete event dynamical systems |
14 | Alak Kumar Datta, Ranjan K. Sen |
An Efficient Parallel Algorithm for Maximal Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONPAR ![In: Parallel Processing: CONPAR 92 - VAPP V, Second Joint International Conference on Vector and Parallel Processing, Lyon, France, September 1-4, 1992, Proceedings, pp. 813-814, 1992, Springer, 3-540-55895-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
14 | Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray |
Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings, pp. 255-269, 1990, Springer, 3-540-53487-3. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
interval trees, complexity, Computational geometry, placement, VLSI layout, geometric algorithms |
14 | Satoru Miyano |
The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings, pp. 425-434, 1987, Springer, 3-540-18088-5. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
14 | Richard M. Karp, Avi Wigderson |
A Fast Parallel Algorithm for the Maximal Independent Set Problem ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 32(4), pp. 762-773, October 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
14 | Zvi Galil |
Efficient Algorithms for Finding Maximal Matching in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings, pp. 90-113, 1983, Springer, 3-540-12727-5. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
Shmathematics, algorithmic tools, monsters, polygamy, the asexual case, the assignment problem, moonlighting, augmenting path, ET, shrink, The Main Theorem of Botany, The ACM Longest Paper Award, generalized priority queue, d-heap, warm-up, primaldual, sexual discrimination, affirmative action, joint income tax return, data structures, matching, duality, blossoms |
14 | Claus-Peter Schnorr |
On Maximal Merging of Information in Boolean Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29 - August 2, 1974, Proceedings, pp. 294-300, 1974, Springer, 3-540-06841-4. The full citation details ...](Pics/full.jpeg) |
1974 |
DBLP DOI BibTeX RDF |
|
13 | Nobuo Funabiki, Junki Shimizu, Toru Nakanishi 0001, Kan Watanabe |
A Proposal of an Active Access-Point Selection Algorithm in Wireless Mesh Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NBiS ![In: The 14th International Conference on Network-Based Information Systems, NBiS 2011, Tirana, Albania, September 7-9, 2011, pp. 112-117, 2011, IEEE Computer Society, 978-1-4577-0789-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
active access point selection, maximal throughput, algorithm, wireless mesh network, index |
13 | Rajiv Misra, Chittaranjan A. Mandal |
Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 21(3), pp. 292-302, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
routing backbone, maximal independent set (MIS), Steiner tree, Connected dominating set (CDS) |
13 | Kamrul Islam 0001, Selim G. Akl, Henk Meijer |
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCOSS ![In: Distributed Computing in Sensor Systems, 5th IEEE International Conference, DCOSS 2009, Marina del Rey, CA, USA, June 8-10, 2009. Proceedings, pp. 343-355, 2009, Springer, 978-3-642-02084-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Minimum Vertex-cut, Wireless Sensor Network, Distributed Algorithm, Maximal Clique |
13 | Ping Luo 0001, Jian Fan, Sam Liu, Fen Lin, Yuhong Xiong, Jerry Liu |
Web article extraction for web printing: a DOM+visual based approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Symposium on Document Engineering ![In: Proceedings of the 2009 ACM Symposium on Document Engineering, Munich, Germany, September 16-18, 2009, pp. 66-69, 2009, ACM, 978-1-60558-575-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
article extraction, maximal scoring subsequence |
13 | Lai-Jiu Lin 0001, Wei-Shih Du |
Systems of equilibrium problems with applications to new variants of Ekeland's variational principle, fixed point theorems and parametric optimization problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 40(4), pp. 663-677, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
?-function, Quasi-distance, Ekeland’s variational principle, Flower petal theorem, Maximal element theorem, Minimax theorem, Minimization theorem, Semi-infinite problem, Generalized Schauder’s fixed point theorem, Equilibrium problem |
13 | Ying-Chao Hung, George Michailidis |
Modeling, scheduling, and simulation of switched processing systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Model. Comput. Simul. ![In: ACM Trans. Model. Comput. Simul. 18(3), pp. 12:1-12:24, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Switched processing systems, average sojourn time, maximal throughput, simulation, scheduling policy, strong stability |
13 | Ning Wang |
Printing Press Fuzzy Identification Based on Pixel Distribution Probability of Character Image. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PACIIA (2) ![In: PACIIA 2008, Volume 2, 2008 IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application, 19-20 December 2008, Wuhan, China, pp. 210-213, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Printing Press, Pixel Distribution Probability, the minimal distance product, the maximal fuzzy correlation measure, Identification |
13 | Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang |
Efficiently answering reachability queries on very large directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008, pp. 595-608, 2008, ACM, 978-1-60558-102-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
maximal directed spanning tree, path-tree cover, transitive closure, graph indexing, reachability queries |
13 | Pascal Cuoq, Damien Doligez |
Hashconsing in an incrementally garbage-collected system: a story of weak pointers and hashconsing in ocaml 3.10.2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ML ![In: Proceedings of the ACM Workshop on ML, 2008, Victoria, BC, Canada, September 21, 2008, pp. 13-22, 2008, ACM, 978-1-60558-062-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hash-consing, maximal sharing, weak hashtables, weak pointers, weak references, garbage collection, ocaml |
13 | Ning Wang |
Printed Chinese Character Recognition Based on Pixel Distribution Probability of Character Image. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IIH-MSP ![In: 4th International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2008), Harbin, China, 15-17 August 2008, Proceedings, pp. 1403-1407, 2008, IEEE Computer Society, 978-0-7695-3278-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Printed Chinese Character, Pixel Distribution Probability, the minimal distance product, the maximal fuzzy correlation measure, Recognition |
13 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail 0001, Katarzyna E. Paluch 0001 |
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(2), pp. 15, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
level maximal, Bipartite matching, strong stability, stable marriage |
13 | Pierre Hansen, Nikolaj van Omme |
On pitfalls in computing the geodetic number of a graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 1(3), pp. 299-307, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Geodetic number, Maximal geodetic closure, Algorithm, Graph |
13 | Camilla Hollanti, Hsiao-feng Lu |
Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007, Proceedings, pp. 227-236, 2007, Springer, 978-3-540-77223-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Asymmetric space-time block codes (ASTBCs), cyclic division algebras (CDAs), dense lattices, diversity-multiplexing tradeoff (DMT), maximal orders, multi-block, multiple-input multiple-output (MIMO) channels, nonvanishing determinant (NVD), discriminants |
13 | Dingxing Zhang, Ming Xu 0002, Wei Xiao, Junwen Gao, Wensheng Tang |
Minimization of the Redundant Sensor Nodes in Dense Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICES ![In: Evolvable Systems: From Biology to Hardware, 7th International Conference, ICES 2007, Wuhan, China, September 21-23, 2007, Proceedings, pp. 355-367, 2007, Springer, 978-3-540-74625-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
coverage sets, local central node, maximal remaining energy, genetic algorithm, multi-objective optimization, Pareto-optimal |
13 | Ajay Kumar Verma, Philip Brisk, Paolo Ienne |
Rethinking custom ISE identification: a new processor-agnostic method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2007 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2007, Salzburg, Austria, September 30 - October 3, 2007, pp. 125-134, 2007, ACM. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
ISE identification, custom processors, maximal cluster |
13 | Antoine Doucet |
Advanced document description, a sequential approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGIR Forum ![In: SIGIR Forum 40(1), pp. 71-72, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
maximal frequent sequences, multi-word units, information retrieval, information systems, sequential patterns, n-grams, document retrieval, collocations, term dependence, phrases, text data mining, automatic indexing, lexical cohesion |
13 | Sriram V. Pemmaraju, Imran A. Pirwani |
Energy conservation via domatic partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2006, Florence, Italy, May 22-25, 2006, pp. 143-154, 2006, ACM, 1-59593-368-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
domatic partition, growth-bounded graphs, distributed algorithms, metric space, dominating sets, unit disk graphs, maximal independent sets, network decomposition, doubling dimension, unit ball graphs |
13 | Tatsunori Mori, Masanori Nozawa, Yoshiaki Asada |
Multi-answer-focused multi-document summarization using a question-answering engine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Asian Lang. Inf. Process. ![In: ACM Trans. Asian Lang. Inf. Process. 4(3), pp. 305-320, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Information gain ratio, maximal marginal relevance, question-answering engine |
13 | J. Z. Liu, Q. Yang, B. Yao, R. W. Brown, G. H. Yue |
Linear correlation between fractal dimension of EEG signal and handgrip force. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Biol. Cybern. ![In: Biol. Cybern. 93(2), pp. 131-140, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Signal complexity, Maximal voluntary contraction (MVC), Dynamic, Brain, Electroencephalography, Motor control |
13 | Rida T. Farouki, Chang Yong Han |
Solution of elementary equations in the Minkowski geometric algebra of complex sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 22(4), pp. 301-323, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Minkowski geometric algebra, equations in complex sets, maximal solution, logarithmic Gauss map, Cartesian oval, ovals of Cassini |
13 | D. Avramouli, John D. Garofalakis, Dimitris J. Kavvadias, Christos Makris, Yannis Panagis, Evangelos Sakkopoulos |
Popular web hot spots identification and visualization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW (Special interest tracks and posters) ![In: Proceedings of the 14th international conference on World Wide Web, WWW 2005, Chiba, Japan, May 10-14, 2005 - Special interest tracks and posters, pp. 912-913, 2005, ACM, 1-59593-051-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
access visualization, maximal forward path, usage mining |
13 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer |
On the locality of bounded growth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005, pp. 60-68, 2005, ACM, 1-58113-994-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bounded growth, distributed algorithms, locality, dominating sets, packing, covering, unit disk graphs, maximal independent set, network decomposition, doubling dimension |
13 | Qing Tao, Jue Wang 0004 |
A New Fuzzy Support Vector Machine Based on the Weighted Margin. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Process. Lett. ![In: Neural Process. Lett. 20(3), pp. 139-150, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
fuzzy pattern recognition, maximal margin algorithm, support vector machines, fuzzy neural networks, margin |
13 | Xiaoyue Zhao, Haiyan Huang, Terence P. Speed |
Finding short DNA motifs using permuted markov models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004, San Diego, California, USA, March 27-31, 2004, pp. 68-75, 2004, ACM, 1-58113-755-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Jeffreys mixture, maximal dependence decomposition, permuted variable length Markov models, weight matrix models, model selection, transcription factor binding sites, splice sites |
13 | Pabitra Mitra, D. Dutta Majumder |
Feature Selection and Gene Clustering from Gene Expression Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (2) ![In: 17th International Conference on Pattern Recognition, ICPR 2004, Cambridge, UK, August 23-26, 2004., pp. 343-346, 2004, IEEE Computer Society, 0-7695-2128-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
maximal information compression index, representation entropy, data mining, Microarray, cancer classification |
13 | Stéphan Ceroi |
A Weighted Version of the Jump Number Problem on Two-Dimensional Orders is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 20(1), pp. 1-11, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
jump number, dimension, maximal independent set |
13 | Ralph Freese, Jennifer Hyndman, James B. Nation |
Whaley's Theorem for Finite Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 20(3), pp. 223-228, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
sublattice, maximal sublattice, lattice, ordered set |
13 | Keye Martin |
A Triangle Inequality for Measurement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 11(1), pp. 27-40, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
maximal elements, metric, domain theory |
13 | Jürgen Forster, Niels Schmitt, Hans Ulrich Simon, Thorsten Suttorp |
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 51(3), pp. 263-281, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
maximal margins, Euclidean half spaces, singular value decomposition |
13 | Dimitrios Gunopulos, Roni Khardon, Heikki Mannila, Sanjeev Saluja, Hannu Toivonen, Ram Sewak Sharm |
Discovering all most specific sentences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 28(2), pp. 140-174, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
learning with membership queries, maximal frequent sets, minimal keys, Data mining, association rules |
13 | Gene W. Yeo, Christopher B. Burge |
Maximum entropy modeling of short sequence motifs with applications to RNA splicing signals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Proceedings of the Sventh Annual International Conference on Computational Biology, RECOMB 2003, Berlin, Germany, April 10-13, 2003, pp. 322-331, 2003, ACM, 1-58113-635-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
maximal dependence decomposition, molecular sequence analysis, non-neighboring dependencies, regulatory elements, Markov models, maximum entropy, splice sites |
13 | Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder |
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 19-22 May 2003, Providence, RI, USA, pp. 96-104, 2003, IEEE Computer Society, 0-7695-1920-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
weakly-connected dominating set, maximal independent set, sparse spanner |
13 | Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder |
Message-optimal connected dominating sets in mobile ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 3rd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2002, June 9-11, 2002, Lausanne, Switzerland, pp. 157-164, 2002, ACM, 1-58113-501-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
ad hoc networks, mobility, connected dominating set, independent set, maximal |
13 | Zoltan Somogyi, Peter J. Stuckey |
Using the heap to eliminate stack accesses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, October 6-8, 2002, Pittsburgh, PA, USA (Affiliated with PLI 2002), pp. 121-132, 2002, ACM. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
heap cells, stack accesses, stack frames, maximal matching |
13 | Dongyang Long, Weijia Jia 0001, Ming Li 0002 |
On Synchronous Coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCC ![In: 2002 International Symposium on Information Technology (ITCC 2002), 8-10 April 2002, Las Vegas, NV, USA, pp. 390-395, 2002, IEEE Computer Society, 0-7695-1506-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
synchronous coding, optimal maximal prefix codes, synchronous code, data compression, Huffman coding |
13 | G. Sajith, Sanjeev Saxena |
Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 27(2), pp. 187-197, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
CRCW model, Tree colouring, Parallel algorithms, Optimal algorithms, Maximal independent set |
13 | Mohammed Javeed Zaki |
Scalable Algorithms for Association Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 12(3), pp. 372-390, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
data mining, Association rules, lattices, frequent itemsets, equivalence classes, maximal cliques |
13 | Lisa Hales, Sean Hallgren |
An Improved Quantum Fourier Transform Algorithm and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 515-525, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
improved quantum Fourier transform algorithm, arbitrary inverse polynomial, Fourier sampling technique, quantum Fourier sampling lemma, arbitrary periodic function, periodic functions, standard quantum lower-bound techniques, maximal class, quantum period-finding algorithm, computational complexity, quantum computing, polynomials, Fourier transforms |
13 | Rida T. Farouki, Weiqing Gu, Hwan Pyo Moon |
Minkowski Roots of Complex Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Geometric Modeling and Processing 2000, Hong Kong, China, April 10-12, 2000, pp. 287-300, 2000, IEEE Computer Society, 0-7695-0562-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Minkowski geometric algebra, ordinary roots, Minkowski roots, minimal and maximal roots, logarithmic convexity, ovals of Cassini, lemniscate of Bernoulli |
13 | Ge-Ming Chiu, Shin-Kung Chen |
An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 10(5), pp. 471-486, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
forbidden region, maximal free submesh, right border line, mesh, Allocation |
13 | Simon Huband, Chris McDonald |
Debugging Parallel Programs Using Incomplete Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCC ![In: International Workshop on Cluster Computing (IWCC '99), 2-3 December 1999, Melbourne, Australia, pp. 278-286, 1999, IEEE Computer Society, 0-7695-0343-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
parallel program debugging, graph distance, maximal common subgraph, topology |
13 | Choi Baek Young, Sung Yang Bang |
Constraints on handwriting Korean characters to improve the machine readability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: 4th International Conference Document Analysis and Recognition (ICDAR '97), 2-Volume Set, August 18-20, 1997, Ulm, Germany, Proceedings, pp. 195-199, 1997, IEEE Computer Society, 0-8186-7898-4. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Korean handwritten characters, machine readability, writing constraints, misrecognitions, ambiguous characters, maximal character disambiguation, handwriting recognition, recognition rate, character recognition system |
13 | Kevin Cattell, Shujian Zhang |
Minimal cost one-dimensional linear hybrid cellular automata of degree through 500. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 6(2), pp. 255-258, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
linear hybrid cellular automata, maximal length cycle, linear feedback shift register, primitive polynomial |
13 | Weijia Shang, José A. B. Fortes |
Independent Partitioning of Algorithms with Uniform Dependencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(2), pp. 190-206, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
uniform dependence algorithms, index sets, maximal independent partitions, optimality, parallel algorithms, computational complexity, computational complexity, lower bounds, upper bounds, multiple instruction multiple data, cardinality, MIMD machines |
13 | Arif Ghafoor, Theodore R. Bashkow |
A Study of Odd Graphs as Fault-Tolerant Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(2), pp. 225-232, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
odd graphs, fault-tolerant interconnection networks, binary n-cube, flip-trees, self-routing algorithms, maximal fault tolerance, partitioning property, self-diagnostics, parallel architectures, fault tolerant computing, mesh, resilience, persistence, ring, star, chordal ring, Hadamard matrices |
13 | Chitta Baral, Sarit Kraus, Jack Minker |
Combining Multiple Knowledge Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 3(2), pp. 208-220, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
multiple knowledge base systems, single knowledge base, function symbols, maximal theory, data integrity, knowledge based system, knowledge based systems, database theory, deductive database, deductive databases, integrity constraints, maximality, view update problem |
13 | Barry Richards, Yuejun Jiang, H. Choi |
On Interval-based Temporal Planning: An IQ Strategy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Methodologies for Intelligent Systems, 6th International Symposium, ISMIS '91, Charlotte, N.C., USA, October 16-19, 1991, Proceedings, pp. 226-235, 1991, Springer, 3-540-54563-8. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
Qualification Problem, Interval Principle, Collapsing and Stretching/Clipping, Temporal Logics, Planning, Constraint Satisfaction, Points, Actions, Intervals, Maximal, Frame Problem |
13 | Johann Eder |
Extending SQL with General Transitive Closure and Extreme Value Selections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 2(4), pp. 381-390, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
general transitive closure, recursive query processing applications, general recursive capabilities, existing query languages, database language SQL, view definition mechanism, extreme value sections, special constructs, maximal values, recursively defined views, nonlinear recursion, standards, database management systems, query languages, attributes, information retrieval systems, tuples, recursive structures |
13 | Mary Ann Kennedy, Gerard G. L. Meyer |
The PMC System Level Fault Model: Cardinality Properties of the Implied Faulty Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(3), pp. 478-480, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
PMC system level fault model, cardinality properties, maximal implied faulty sets, lower bounds, fault tolerant computing, diagnosis algorithms |
13 | Bhargab B. Bhattacharya, Sharad C. Seth |
Design of Parity Testable Combinational Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(11), pp. 1580-1584, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
parity testable combinational circuits, maximal supergates, single external test-mode pin, logic testing, integrated circuit testing, design for testability, integrated logic circuits, combinatorial circuits |
13 | Lajos Rónyai |
Galois Groups and Factoring Polynomials over Finite Fields ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 99-104, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
smooth multiplicative subgroups, factoring polynomials, integer coefficients, maximal size, generalized Riemann hypothesis, irreducible factors, deterministic time polynomial, elliptic analog, finite fields, elliptic curve, discriminant, prime, splitting field, Galois groups |
13 | Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya |
Sublinear-Time Parallel Algorithms for Matching and Related Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 174-185, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
sublinear-time parallel algorithms, maximal node-disjoint paths, zero-one networks, matching, depth-first search, node-disjoint paths, combinatorial structure |
13 | Gururaj S. Rao, Harold S. Stone, T. C. Hu |
Assignment of Task in a Distributed Processor System with Limited Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 28(4), pp. 291-299, 1979. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
Ford?Fulkerson algorithm, Gomory?Hu cut trees, multiterminal maximal flows, load balancing, distributed computers, Computer networks, NP-complete problems, cutsets |
13 | Farhad Hemmati, Daniel J. Costello Jr. |
An Algebraic Construction for q-ary Shift Register Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 27(12), pp. 1192-1195, 1978. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
shift register sequence, maximal length cycle, Euclidean Algorithm, Hamming weight |
13 | Totadri Jayasri, Dhruba Basu |
An Approach to Organizing Microinstructions which Minimizes the Width of Control Store Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 25(5), pp. 514-521, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
maximal compatibility class, microinstruction organization, minimizing control store width, Linear programming, microprogramming |
13 | Richard F. King, David L. Phillips |
The logarithmic error and Newton's method for the square root. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 12(2), pp. 87-88, 1969. The full citation details ...](Pics/full.jpeg) |
1969 |
DBLP DOI BibTeX RDF |
error curve, integer root, logarithmic error, maximal error, relative error, square root, recurrence relation, Newton's method, optimal approximation, best fit |
10 | Antoine Girard |
Synthesis using approximately bisimilar abstractions: state-feedback controllers for safety specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2010, Stockholm, Sweden, April 12-15, 2010, pp. 111-120, 2010, ACM, 978-1-60558-955-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
approximate bisimulation, abstraction, synthesis, safety, hybrid systems, switched systems |
10 | Marc Glisse, Sylvain Lazard |
On the complexity of sets of free lines and line segments among balls in three dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 48-57, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
3D visibility, free lines, free segments, visibility complex, balls |
10 | Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow |
Points with large quadrant-depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 358-364, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
depth, point set, plane |
10 | Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz |
Online set packing and competitive scheduling of multi-part tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 440-449, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
multi-packet frames, online set packing, packet fragmentation, competitive analysis |
10 | Dominique Michelucci, Pascal Schreck, Simon E. B. Thierry, Christoph Fünfzig, Jean-David Génevaux |
Using the witness method to detect rigid subsystems of geometric constraints in CAD. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Solid and Physical Modeling ![In: ACM Symposium on Solid and Physical Modeling, Proceedings of the 15th ACM Symposium on Solid and Physical Modeling, SPM 2010, Haifa, Israel, September 1-3, 2010, pp. 91-100, 2010, ACM, 978-1-60558-984-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
W-decomposition, rigidity theory, witness configuration, geometric constraints solving, Jacobian matrix |
10 | Tae Won Ban, Wan Choi 0001, Bang Chul Jung, Dan Keun Sung |
A cooperative phase steering scheme in multi-relay node environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 8(1), pp. 72-77, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Andrea J. Goldsmith, Juan P. Peña-Martin, Gabriel Aguilera 0001, Juan M. Romero-Jerez |
Performance comparison of MRC and IC under transmit diversity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 8(5), pp. 2484-2493, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Stephen J. Willson |
Robustness of Topological Supertree Methods for Reconciling Dense Incompatible Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 6(1), pp. 62-75, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Trees, Graph algorithms, phylogenetic tree, supertree |
10 | Weidong Chen 0009, Wenjun Xiao, Behrooz Parhami |
Swapped (OTIS) Networks Built of Connected Basis Networks Are Maximally Fault Tolerant. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 20(3), pp. 361-366, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Frank Uhlig |
Geometric computation of the numerical radius of a matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 52(3), pp. 335-353, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 15-04, 15A60, 51M16, 65S05, 65F30, 65D18 |
10 | Jean-Paul Penot, Constantin Zalinescu |
Convex analysis can be helpful for the asymptotic analysis of monotone operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 116(1-2), pp. 481-498, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 47H05, 26C60, 58C06, 49J53 |
10 | Natalia Vanetik |
Path packing and a related optimization problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 17(2), pp. 192-205, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Path packing, Multiflow, K-clutter |
10 | Oktay Altun, Adem Orsdemir, Gaurav Sharma 0001, Mark F. Bocko |
Optimal Spread Spectrum Watermark Embedding via a Multistep Feasibility Formulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 18(2), pp. 371-387, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Hagai Cohen, Ely Porat |
Range Non-overlapping Indexing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 1044-1053, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Albert Bifet, Ricard Gavaldà |
Adaptive XML Tree Classification on Evolving Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML/PKDD (1) ![In: Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2009, Bled, Slovenia, September 7-11, 2009, Proceedings, Part I, pp. 147-162, 2009, Springer, 978-3-642-04179-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Duoqian Miao, Nan Zhang, Xiaodong Yue |
Knowledge reduction in interval-valued information systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ICCI ![In: Proceedings of the 8th IEEE International Conference on Cognitive Informatics, ICCI 2009, June 15-17, 2009, Hong Kong, China, pp. 320-327, 2009, IEEE Computer Society, 978-1-4244-4642-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani |
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADHOC-NOW ![In: Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, ADHOC-NOW 2009, Murcia, Spain, September 22-25, 2009, Proceedings, pp. 194-212, 2009, Springer, 978-3-642-04382-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Intruder, Optimal Movement, Sensors, NP-complete, Coverage, Detection, PTAS, Barrier, Line Segment |
10 | Yueguo Chen, Gang Chen 0001, Ke Chen 0005, Beng Chin Ooi |
Efficient Processing of Warping Time Series Join of Motion Capture Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 1048-1059, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Thomas Jansen 0001, Christine Zarges |
Comparing Different Aging Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICARIS ![In: Artificial Immune Systems, 8th International Conference, ICARIS 2009, York, UK, August 9-12, 2009. Proceedings, pp. 95-108, 2009, Springer, 978-3-642-03245-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Yongyan Wang, Kun Li, Hongan Wang |
Maintaining only frequent itemsets to mine approximate frequent itemsets over online data streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIDM ![In: Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2009, part of the IEEE Symposium Series on Computational Intelligence 2009, Nashville, TN, USA, March 30, 2009 - April 2, 2009, pp. 381-388, 2009, IEEE, 978-1-4244-2765-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Roberto Lublinerman, Christian Szegedy, Stavros Tripakis |
Modular code generation from synchronous block diagrams: modularity vs. code size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009, pp. 78-89, 2009, ACM, 978-1-60558-379-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
clustering, code generation, np-complete, embedded software, synchronous languages, block diagrams |
|
|