|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 15540 occurrences of 6850 keywords
|
|
|
Results
Found 25155 publication records. Showing 25155 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
51 | Hong-Zhong Huang, Ye Tao, Yu Liu 0006 |
Multidisciplinary collaborative optimization using fuzzy satisfaction degree and fuzzy sufficiency degree model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 12(10), pp. 995-1005, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Collaborative optimization, Fuzzy satisfaction degree, Fuzzy sufficiency degree, Multidisciplinary design optimization |
51 | Lap Chi Lau, Mohit Singh |
Additive approximation for bounded degree survivable network design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 759-768, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, steiner tree, bounded degree, iterative rounding, survivable network design |
47 | David J. Pritchard, Denis A. Nicole |
Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 4(1), pp. 111-117, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
deadlock-free fixed degree network, cube-connected Mobius ladders, deadlock-free routingstrategy, fixed node degree, fixed degree topology of size, transputernetworks, parallel algorithms, computational complexity, graph theory, topology, Cayley graph, multiprocessorinterconnection network, network diameter, multiprocessor interconnectionnetworks, interval routing |
44 | Andrea Francke, Michael Hoffmann 0001 |
The Euclidean degree-4 minimum spanning tree problem is NP-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 179-188, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
degree-constricted graphs, degree-restricted graphs, np-complete, reduction, spanning trees, geometric optimization, geometric graphs, bounded-degree graphs |
44 | Tao Li, Xiao Ciyuan |
Research of Group Decision Consensus Degree Based on Extended Intuitionistic Fuzzy Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFIE ![In: Fuzzy Information and Engineering, Proceedings of the Second International Conference of Fuzzy Information and Engineering, ICFIE 2007, May 13-16, 2007, Guangzhou, China, pp. 768-772, 2007, Springer, 978-3-540-71440-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
extended intuitionistic fuzzy sets, intuitionistic fuzzy distance, consensus degree, average consensus degree, relative consensus degree |
44 | Ming Li, De-San Yang |
Application of Discrimination Degree for Attributes Reduction in Concept Lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 11th Pacific-Asia Conference, PAKDD 2007, Nanjing, China, May 22-25, 2007, Proceedings, pp. 648-655, 2007, Springer, 978-3-540-71700-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Inclusion degree, Discrimination degree, Concept lattice, Attributes reduction |
42 | Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung |
Degree Bounded Network Design with Metric Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 125-134, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
42 | Nikhil Bansal 0001, Rohit Khandekar, Viswanath Nagarajan |
Additive guarantees for degree bounded directed network design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 769-778, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, directed graphs, network design |
40 | Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh 0001 |
Degree-Constrained Subgraph Problems: Hardness and Approximation Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers, pp. 29-42, 2008, Springer, 978-3-540-93979-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Degree-Constrained Subgraphs, Apx, Excluded Minor, Approximation Algorithms, Hardness of Approximation, PTAS |
40 | Mário M. Freire, Joel J. P. C. Rodrigues, Rui M. F. Coelho |
The Role of Network Topologies in the Optical Core of IP-over-WDM Networks with Static Wavelength Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 24(2-4), pp. 111-122, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
optical Internet, routing, network topologies, optical networks |
39 | Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz |
Performance Implications of Meshing Degree for Optical Burst Switched Networks Using One-Way Resource Reservation Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 30(1-3), pp. 35-47, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
optical internet, performance, optical burst switching, resource reservation protocols |
39 | Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz |
The Role of Meshing Degree in Optical Burst Switching Networks Using Signaling Protocols with One-Way Reservation Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICN (1) ![In: Networking - ICN 2005, 4th International Conference on Networking, ReunionIsland, France, April 17-21, 2005, Proceedings, Part I, pp. 44-51, 2005, Springer, 3-540-25339-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Anthony J. Dunlop, Marian Boykan Pour-El |
The Degree of Unsolvability of a Real Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCA ![In: Computability and Complexity in Analysis, 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers, pp. 16-29, 2000, Springer, 3-540-42197-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
36 | Thomas Fritz 0001, Jingwen Ou, Gail C. Murphy, Emerson R. Murphy-Hill |
A degree-of-knowledge model to capture source code familiarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE (1) ![In: Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1, ICSE 2010, Cape Town, South Africa, 1-8 May 2010, pp. 385-394, 2010, ACM, 978-1-60558-719-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
degree-of-knowledge, onboarding, interaction, recommendation, expertise, authorship, degree-of-interest |
36 | Sanjeev Arora, Kevin L. Chang |
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(3), pp. 189-210, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Degree-Restricted Minimum Spanning Tree, Low degree, Approximation algorithm |
35 | Mohit Singh, Lap Chi Lau |
Approximating minimum bounded degree spanning trees to within one of optimal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 661-670, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
approximation algorithm, spanning trees, bounded degree, iterative rounding |
35 | Dana Moshkovitz, Ran Raz |
Sub-constant error low degree test of almost-linear size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 21-30, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
plane vs. point test, probabilistically checkable proofs, locally testable codes, low degree testing |
35 | Navaratnasothie Selvakkumaran, Phiroze N. Parakh, George Karypis |
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SLIP ![In: The 5th International Workshop on System-Level Interconnect Prediction (SLIP 2003), Monterey, CA, USA, April 5-6, 2003, Proceedings, pp. 53-59, 2003, ACM, 1-58113-627-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
interconnection complexity, multilevel global placement, nonhomogeneity, perimeter-degree, congestion, routability |
35 | Jochen Könemann, R. Ravi 0001 |
Primal-dual meets local search: approximating MST's with nonuniform degree bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 389-395, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
degree-bounded spanning trees, approximation algorithms, spanning trees, network algorithms, bicriteria approximation |
35 | Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Jamin, Scott Shenker, Walter Willinger |
Network topology generators: degree-based vs. structural. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCOMM ![In: Proceedings of the ACM SIGCOMM 2002 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 19-23, 2002, Pittsburgh, PA, USA, pp. 147-159, 2002, ACM, 1-58113-570-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
degree-based generators, large-scale structure, structural generators, topology characterization, topology metrics, network topology, hierarchy, topology generators |
34 | Yushin Cho, William A. Pearlman |
Quantifying the Coding Performance of Zerotrees of Wavelet Coefficients: Degree-k Zerotree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 55(6-1), pp. 2425-2431, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Maria Jump, Kathryn S. McKinley |
Dynamic shape analysis via degree metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 8th International Symposium on Memory Management, ISMM 2009, Dublin, Ireland, June 19-20, 2009, pp. 119-128, 2009, ACM, 978-1-60558-347-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
degree metrics, dynamic invariants, dynamic shape analysis |
32 | QianQian Hu, GuoJin Wang |
A novel algorithm for explicit optimal multi-degree reduction of triangular surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 51(1), pp. 13-24, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
triangular Bézier surface, multi-degree reduction, Jacobi polynomial, L 2 norm, computer aided design, data compression, Bernstein polynomial |
32 | Alexandra A. Soskova |
A Jump Inversion Theorem for the Degree Spectra. ![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. 716-726, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
enumeration degrees, degree spectra, Marker’s extensions, enumerations |
32 | Thang Nguyen Bui, Catherine M. Zrncic |
An ant-based algorithm for finding degree-constrained minimum spanning tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006, pp. 11-18, 2006, ACM, 1-59593-186-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
degree constrained spanning tree, ant algorithm |
32 | Manimegalai M. Subramaniam |
The emergence of IT degree programs: when did it happen? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGITE Conference ![In: Proceedings of the 6th Conference on Information Technology Education, SIGITE 2005, Newark, NJ, USA, October 20-22, 2005, pp. 31-35, 2005, ACM, 1-59593-252-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
IT degree programs, emergence of IT education, IT curricula |
32 | Enes Pasalic |
Degree Optimized Resilient Boolean Functions from Maiorana-McFarland Class. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMACC ![In: Cryptography and Coding, 9th IMA International Conference, Cirencester, UK, December 16-18, 2003, Proceedings, pp. 93-114, 2003, Springer, 3-540-20663-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Boolean Function, Resiliency, Nonlinearity, Algebraic Degree |
32 | Yu Wang 0003, Xiang-Yang Li 0001 |
Localized construction of bounded degree and planar spanner for wireless ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DIALM-POMC ![In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, San Diego, CA, USA, September 19, 2003, pp. 59-68, 2003, ACM. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
wireless ad hoc networks, topology control, localized algorithm, spanner, planar, bounded degree |
32 | Michael J. Docherty, Peter Sutton, Margot Brereton, Simon M. Kaplan, Allison Brown |
The information environments program - a new design based IT degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSE ![In: Proceedings of the ACM SIGCSE 4th Australasian Conference on Computer Science Education, ACSE 2000, Melbourne, Victoria, Australia, 2000, pp. 64-70, 2000, ACM, 1-58113-271-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
design-based IT degree, information environments, studio-based learning, curriculum |
32 | Wolfgang Merkle, Frank Stephan 0001 |
On C-Degrees, H-Degrees and T-Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 60-69, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz |
Performance Assessment of Optical Burst Switched Degree-Four Chordal Ring Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICT ![In: Telecommunications and Networking - ICT 2004, 11th International Conference on Telecommunications, Fortaleza, Brazil, August 1-6, 2004, Proceedings, pp. 760-765, 2004, Springer, 3-540-22571-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Hyunwoo Chun, Haewoon Kwak, Young-Ho Eom, Yong-Yeol Ahn, Sue B. Moon, Hawoong Jeong |
Comparison of online social relations in volume vs interaction: a case study of cyworld. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Internet Measurement Conference ![In: Proceedings of the 8th ACM SIGCOMM Internet Measurement Conference, IMC 2008, Vouliagmeni, Greece, October 20-22, 2008, pp. 57-70, 2008, ACM, 978-1-60558-334-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
cyworld, degree correlation, friend relationship, guestbook log, k-core, reciprocity, online social network, disparity, degree distribution, clustering coefficient, network motif |
30 | Shao Liu, Minghua Chen 0001, Sudipta Sengupta, Mung Chiang, Jin Li 0001, Philip A. Chou |
P2P Streaming Capacity under Node Degree Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 2010 International Conference on Distributed Computing Systems, ICDCS 2010, Genova, Italy, June 21-25, 2010, pp. 587-598, 2010, IEEE Computer Society, 978-0-7695-4059-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
P2P Streaming Capacity, Node Degree Bound, Node Out-Degree Bound, P2P Streaming |
30 | Mihir K. Chakraborty, Pulak Samanta |
Consistency-Degree Between Knowledges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSEISP ![In: Rough Sets and Intelligent Systems Paradigms, International Conference, RSEISP 2007, Warsaw, Poland, June 28-30, 2007, Proceedings, pp. 133-141, 2007, Springer, 978-3-540-73450-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
elementary category, dependency degree, consistency degree, Rough Sets, knowledge |
30 | Omer Reingold, Salil P. Vadhan, Avi Wigderson |
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. ![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. 3-13, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
entropy waves, zig-zag graph product, constant-degree expanders, constant-degree extractors, constructive interference, explicit extractors, high min-entropy sources, eigenvalue bound, graph theory, probability, entropy, probability distributions, eigenvalues and eigenfunctions |
30 | Roman Smolensky |
On Representations by Low-Degree Polynomials ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 130-138, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
many-output function, boolean cube, nonzeroes, Hilbert function, projective space, low-degree polynomials, low-degree polynomial |
29 | João M. Fernandes, Ricardo Jorge Machado 0001 |
A Two-Year Software Engineering M.Sc. Degree Designed Under the Bologna Declaration Principles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSEA ![In: Proceedings of the International Conference on Software Engineering Advances (ICSEA 2006), October 28 - November 2, 2006, Papeete, Tahiti, French Polynesia, pp. 1, 2006, IEEE Computer Society, 0-7695-2703-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Bologna declaration, master degree, project-led engineering education, Software engineering |
29 | Franz-Josef Brandenburg |
The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings, pp. 312-322, 1991, Springer, 3-540-53904-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
boundary and confluent graph grammars, operator normal form, graph languages of bounded degree, graph grammars |
29 | Tamás Király, Lap Chi Lau, Mohit Singh |
Degree Bounded Matroids and Submodular Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 259-272, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Mário M. Freire, Rui M. F. Coelho, Joel J. P. C. Rodrigues |
The Role of Nodal Degree in the Optical Core of IP-over-WDM Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the Eighth IEEE Symposium on Computers and Communications (ISCC 2003), 30 June - 3 July 2003, Kiris-Kemer, Turkey, pp. 661-665, 2003, IEEE Computer Society, 0-7695-1961-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Rui M. F. Coelho, Joel J. P. C. Rodrigues, Mário M. Freire |
Performance Analysis of Degree Four Topologies for the Optical Core of IP-over-WDM Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICOIN ![In: Information Networking, Networking Technologies for Enhanced Internet Services International Conference, ICOIN 2003, Cheju Island, Korea, February 12-14, 2003, Revised Selected Papers, pp. 108-117, 2003, Springer, 3-540-40827-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis |
Self-stabilizing minimum-degree spanning tree within one from the optimal degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, May 23-29, 2009, pp. 1-11, 2009, IEEE. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Kun Liu 0001, Evimaria Terzi |
Towards identity anonymization on 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. 93-106, 2008, ACM, 978-1-60558-102-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
degree sequence, dynamic programming, anonymity |
27 | Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz |
Resource Allocation in Bounded Degree Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(1), pp. 89-106, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bounded degree trees, Scheduling, Approximation algorithms, Bandwidth allocation, Storage allocation |
27 | Zhenting Hou, Xiangxing Kong, Dinghua Shi, Guanrong Chen, Qinggui Zhao |
Degree-Distribution Stability of Growing Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex (2) ![In: Complex Sciences, First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 2, pp. 1827-1837, 2009, Springer, 978-3-642-02468-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
growing network Markov chains, BA model, scale-free, degree distribution |
27 | Shachar Lovett |
Unconditional pseudorandom generators for low degree polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 557-562, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
fourier analysis, pseudorandom generators, low degree tests |
27 | Quansheng Dou, Zhijun Yu, Zhongzhi Shi, Erkeng Yu, Yongzhi Zheng |
Cluster-Degree Analysis and Velocity Compensation Strategy of PSO. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISICA ![In: Advances in Computation and Intelligence, Third International Symposium, ISICA 2008, Wuhan, China, December 19-21, 2008 Proceedings, pp. 98-106, 2008, Springer, 978-3-540-92136-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
cluster-degree, particle swarm optimization, convergence property |
27 | Tao Wan, Malgorzata Chrzanowska-Jeske |
Prediction of interconnect net-degree distribution based on Rent's rule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SLIP ![In: The Sixth International Workshop on System-Level Interconnect Prediction (SLIP 2004), Paris, France, February 14-15, 2004, Proceedings, pp. 107-114, 2004, ACM, 1-58113-818-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
net-degree distribution, Rent's rule, interconnect prediction |
27 | Guillermo De Ita Luna |
Polynomial Classes of Boolean Formulas for Computing the Degree of Belief. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IBERAMIA ![In: Advances in Artificial Intelligence - IBERAMIA 2004, 9th Ibero-American Conference on AI, Puebla, Mexico, November 22-26, 2004, Proceedings, pp. 430-440, 2004, Springer, 3-540-23806-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
#SAT Problem, Updating Beliefs, Approximate Reasoning, Degree of Belief |
27 | Michael S. Floater, Tom Lyche |
Asymptotic convergence of degree-raising. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 12(2-3), pp. 175-187, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
degree-raising, Voronovskaya estimates, 65B17, 65D05, 41A25, 41A10, Bernstein polynomials |
27 | Paola Alimonti, Tiziana Calamoneri |
Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 2-16, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Minimum Independent Dominating Set, Approximation Algorithms, Local Search, Greedy, Regular Graphs, Cubic Graphs, Bounded Degree Graphs |
27 | Joseph W. H. Liu |
Modification of the Minimum-Degree Algorithm by Multiple Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 11(2), pp. 141-153, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
minimum degree, sparse ordering, ordering, elimination |
26 | Willi Meier, Enes Pasalic, Claude Carlet |
Algebraic Attacks and Decomposition of Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004, Proceedings, pp. 474-491, 2004, Springer, 3-540-21935-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Kai-di Liu, Jin Wang, Yan-jun Pang, Jin Liu, Jun-hu Ruan |
The Mathematic Method of Membership Conversion from Degree of Coordinates to Degree of Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESIAT (2) ![In: 2009 International Conference on Environmental Science and Information Application Technology, ESIAT 2009, Wuhan, China, 4-5 July 2009, 3 Volumes, pp. 603-608, 2009, IEEE Computer Society, 978-0-7695-3682-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
multi-indexes decision, membership degree conversion, distinguishable weight, valid values, membership function |
26 | Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar |
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 157-189, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Combinatorial optimization, Matching, Minimum spanning trees |
26 | Claus Diem |
An Index Calculus Algorithm for Plane Curves of Small Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings, pp. 543-557, 2006, Springer, 3-540-36075-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | James F. Lynch |
Convergence law for random graphs with specified degree sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 6(4), pp. 727-748, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
random graphs, Finite model theory |
26 | Dimitris Achlioptas, Aaron Clauset, David Kempe 0001, Cristopher Moore |
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 694-703, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
internet mapping, random graphs, power laws |
26 | James F. Lynch |
Convergence Law for Random Graphs with Specified Degree Sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22-25 June 2003, Ottawa, Canada, Proceedings, pp. 301-, 2003, IEEE Computer Society, 0-7695-1884-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Gabriel Robins, Jeffrey S. Salowe |
On the Maximum Degree of Minimum Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York, USA, June 6-8, 1994, pp. 250-258, 1994, ACM, 0-89791-648-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Congjun Rao, Jin Peng, Wenlue Chen |
Novel Method for Fuzzy Hybrid Multiple Attribute Decision Making. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFIE ![In: Fuzzy Information and Engineering, Proceedings of the Second International Conference of Fuzzy Information and Engineering, ICFIE 2007, May 13-16, 2007, Guangzhou, China, pp. 583-591, 2007, Springer, 978-3-540-71440-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Fuzzy hybrid multiple attribute decision making, Grey relational degree, Approach degree, Fuzzy number, Interval number |
25 | Martin Fürer, Balaji Raghavachari |
Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA., pp. 317-324, 1992, ACM/SIAM, 0-89791-466-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
25 | Zhengping He, Hongtao Zhou, Wei Zeng 0009, Yushuo Chen, Qi Fei |
Research on Coordination Model of Multiplexed System Based on DEA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2009, 6th International Symposium on Neural Networks, ISNN 2009, Wuhan, China, May 26-29, 2009, Proceedings, Part I, pp. 1107-1114, 2009, Springer, 978-3-642-01506-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Coordination Degree, Data Envelopment Analysis (DEA), Multiplexed System |
25 | Makoto Ichii, Makoto Matsushita, Katsuro Inoue |
An Exploration of Power-Law in Use-Relation of Java Software Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Software Engineering Conference ![In: 19th Australian Software Engineering Conference (ASWEC 2008), March 25-28, 2008, Perth, Australia, pp. 422-431, 2008, IEEE Computer Society, 978-0-7695-3100-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Software Component Graph, Power-law, Scale-free Network, Degree Distribution |
25 | Ching-Hsien Hsu, Shih-Chang Chen, Chao-Yang Lan |
Scheduling contention-free irregular redistributions in parallelizing compilers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 40(3), pp. 229-247, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Irregular redistribution, GEN_BLOCK, Parallelizing compiler, Communication scheduling, Degree-reduction |
25 | Frédéric Didier, Jean-Pierre Tillich |
Computing the Algebraic Immunity Efficiently. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSE ![In: Fast Software Encryption, 13th International Workshop, FSE 2006, Graz, Austria, March 15-17, 2006, Revised Selected Papers, pp. 359-374, 2006, Springer, 3-540-36597-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Low degree multiple, Boolean functions, Stream ciphers, Algebraic attacks, Algebraic immunity, Annihilator |
25 | Liangbin Wang, Guojin Zhu |
Developing an XML Schema of BWW Ontologies for Semantic Web. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2004), 10-12 May 2004, Hong Kong, SAR, China, pp. 220-225, 2004, IEEE Computer Society, 0-7695-2135-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
higher-degree relation, Semantic Web, ontological constructs, Web modeling |
24 | Myoungsu Cho, Bo Hyoung Kim, Dong Kyun Jeong, Yeong-Gil Shin, Jinwook Seo |
Dynamic query interface for spatial proximity query with degree-of-interest varied by distance to query point. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI ![In: Proceedings of the 28th International Conference on Human Factors in Computing Systems, CHI 2010, Atlanta, Georgia, USA, April 10-15, 2010, pp. 693-702, 2010, ACM, 978-1-60558-929-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
dynamic query interface, spatial proximity query, tab interface, visual information seeking, degree-of-interest |
24 | Roy Friedman, Alex Kogan |
Brief announcement: deterministic dominating set construction in networks with bounded degree. ![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. 285-286, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
dominating sets, bounded degree graphs, distributed approximation algorithms |
24 | Takuro Fukunaga, Hiroshi Nagamochi |
Network Design with Edge-Connectivity and Degree Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(3), pp. 512-532, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Degree constraint, (m,n)-VRP, Approximation algorithm, TSP, Vehicle routing problem, Edge-connectivity |
24 | Xiaojun Zhang, Zheng He |
A More Strict Definition of Steady State Degree Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex (2) ![In: Complex Sciences, First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 2, pp. 1322-1328, 2009, Springer, 978-3-642-02468-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Steady state degree distribution, evolving network, stochastic process |
24 | Noriaki Kawamae, Hitoshi Sakano, Takeshi Yamada |
Personalized recommendation based on the personal innovator degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RecSys ![In: Proceedings of the 2009 ACM Conference on Recommender Systems, RecSys 2009, New York, NY, USA, October 23-25, 2009, pp. 329-332, 2009, ACM, 978-1-60558-435-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
personal innovator degree, purchase innovator, personalization, collaborative filtering, recommendation, serendipity |
24 | Aileen Zhang, Chu-Wee Lim, Khoongming Khoo, Lei Wei 0001, Josef Pieprzyk |
Extensions of the Cube Attack Based on Low Degree Annihilators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CANS ![In: Cryptology and Network Security, 8th International Conference, CANS 2009, Kanazawa, Japan, December 12-14, 2009. Proceedings, pp. 87-102, 2009, Springer, 978-3-642-10432-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Cube Attack, Low-Degree Annihilators, Algebraic Attack |
24 | Huynh Thi Thanh Binh, Truong Binh Nguyen |
New Particle Swarm Optimization Algorithm for Solving Degree Constrained Minimum Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRICAI ![In: PRICAI 2008: Trends in Artificial Intelligence, 10th Pacific Rim International Conference on Artificial Intelligence, Hanoi, Vietnam, December 15-19, 2008. Proceedings, pp. 1077-1085, 2008, Springer, 978-3-540-89196-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
degree constrained minimum spanning tree, genetic algorithm, particle swarm optimization, swarm intelligent |
24 | 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 |
24 | Fachao Li 0001, Chenxia Jin |
Fuzzy Genetic Algorithm Based on Principal Operation and Inequity Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, Third International Conference on Intelligent Computing, ICIC 2007, Qingdao, China, August 21-24, 2007, Proceedings, pp. 593-604, 2007, Springer, 978-3-540-74201-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
fuzzy inequity degree, principal index, BPO&ID-FGA, Markov chain, Fuzzy optimization, fuzzy genetic algorithm |
24 | Yang Wang |
It is time for a computer application degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGCSE Bull. ![In: ACM SIGCSE Bull. 38(2), pp. 105-109, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
degree programs, curriculum, computer science, computer applications |
24 | Yu Wang 0003, Xiang-Yang Li 0001 |
Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 11(2), pp. 161-175, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Wireless ad hoc networks, topology control, localized algorithm, spanner, planar, bounded degree |
24 | Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid |
Constructing Plane Spanners of Bounded Degree and Low Weight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 42(3-4), pp. 249-264, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Low weight graphs, Computational geometry, Planar graphs, Spanners, Bounded degree graphs |
24 | Sonia Pérez-Díaz, J. Rafael Sendra |
Partial degree formulae for rational algebraic surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 301-308, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
partial degrees of an algebraic surface, rational map degree, rational surface parametrization, algebraic surface |
24 | Hossein Hajiabolhassan, Xuding Zhu |
Sparse H-Colourable Graphs of Bounded Maximum Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(1), pp. 65-71, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Uniquely H-colourable graphs, Bounded maximum degree, Girth |
24 | Lidan Shou, Zhiyong Huang, Kian-Lee Tan |
The Hierarchical Degree-of-Visibility Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 16(11), pp. 1357-1369, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Degree of visibility, HDoV-tree, performance and visual fidelity, virtual environment, level-of-details |
24 | Lélia Blin, Franck Butelle |
The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings, pp. 161, 2003, IEEE Computer Society, 0-7695-1926-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Minimum degree spanning trees, Distributed algorithms, Spanning trees, Asynchronous algorithms, general graphs |
24 | Navaratnasothie Selvakkumaran, George Karypis |
Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2003 International Conference on Computer-Aided Design, ICCAD 2003, San Jose, CA, USA, November 9-13, 2003, pp. 726-733, 2003, IEEE Computer Society / ACM, 1-58113-762-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Maximum Subdomain Degree, Partitioning, Placement, Congestion |
24 | Ryan O'Donnell, Rocco A. Servedio |
New degree bounds for polynomial threshold functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 325-334, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
ptfs, learning, lower bounds, polynomials, duality, degree, formulas, polynomial threshold functions |
24 | Eli Ben-Sasson, Madhu Sudan 0001, Salil P. Vadhan, Avi Wigderson |
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 612-621, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
property testing, probabilistically checkable proofs, locally testable codes, linearity testing, low degree testing |
24 | D. Dijkstra |
Doubling the Degree of Precision Without Doubling the Grid When Solving a Differential Equation with a Pseudo-Spectral Collocation Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sci. Comput. ![In: J. Sci. Comput. 17(1-4), pp. 513-527, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
double collocation, double precision degree, pseudo-spectral collocation, differentiation matrices, Hermite interpolation |
24 | Li-Jen Mao, Sheau-Dong Lang |
Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: 31st International Conference on Parallel Processing Workshops (ICPP 2002 Workshops), 20-23 August 2002, Vancouver, BC, Canada, pp. 398-404, 2002, IEEE Computer Society, 0-7695-1680-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Parallel approximate algorithm, degree-constrained minimum spanning tree, nearest neighbor chain, heap traversal |
24 | I. Ben Salah, Pascal Maroni |
The connection between self-associated two-dimensional vector functionals and third degree forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 13(1), pp. 51-77, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Stieltjes functions, third degree forms, Laguerre-Hahn polynomials, 2-orthogonal polynomials, integral representations, 42C05, 33C45 |
24 | Manfred Göbel |
Rewriting Techniques and Degree Bounds for Higher Order Symmetric Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 9(6), pp. 559-573, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Higher order symmetry, Degree bounds, Rewriting techniques, Generators, Symmetric polynomials |
24 | Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang |
A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 23-25 June 1999, Fremantle, Australia, pp. 184-189, 1999, IEEE Computer Society, 0-7695-0231-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Parallel approximate algorithm, degree-constrained MST, reciprocal nearest neighbors, minimum spanning tree |
24 | Satoshi Kimura, Masahiko Yachida |
Facial Expression Recognition and Its Degree Estimatio. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97), June 17-19, 1997, San Juan, Puerto Rico, pp. 295-300, 1997, IEEE Computer Society, 0-8186-7822-4. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Degree of facial expression, Variation from expressionless face, Potential Net Model, K-L expansion, Facial expression recognition, Emotion Space |
24 | Premkumar Vadapalli, Pradip K. Srimani |
A New Family of Cayley Graph Interconnection Networks of Constant Degree Four. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 7(1), pp. 26-32, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
constant degree, simple routing, fault tolerance, Interconnection network, generators, Cayley graph, optimal routing |
24 | Jiang Liu 0002, Guohua Wu |
Joining to High Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings, pp. 370-378, 2008, Springer, 978-3-540-69405-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz |
One-Way Resource Reservation Protocols for IP Over Optical Burst Switched Mesh Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Systems Communications ![In: Systems Communications 2005 (ICW / ICHSN / ICMCS / SENET 2005), 14-17 August 2005, Montreal, Canada, pp. 229-234, 2005, IEEE Computer Society, 0-7695-2422-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Hettihe P. Dharmasena, Ramachandran Vaidyanathan |
Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 53(12), pp. 1535-1546, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Multiple bus networks, binary tree algorithms, bus loading, interconnection networks, lower bounds |
23 | Jin Fan, David J. Hill 0001 |
Enhancement of Synchronizability of the Kuramoto Model with Assortative Degree-Frequency Mixing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex (2) ![In: Complex Sciences, First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 2, pp. 1967-1972, 2009, Springer, 978-3-642-02468-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Kuramoto model, assortative, synchronization, correlation |
23 | Jianhong Ke, Xiaoshuang Chen |
Degree Distribution of a Two-Component Growing Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex (2) ![In: Complex Sciences, First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 2, pp. 1838-1845, 2009, Springer, 978-3-642-02468-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
growing network, rate equation approach, connectivity, scale-free |
23 | Ido Ben-Eliezer, Rani Hod, Shachar Lovett |
Random Low Degree Polynomials are Hard to Approximate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 366-377, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | S. Barry Cooper, Angsheng Li |
On Lachlan's major sub-degree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 47(4), pp. 341-434, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) Primary 03D25, Secondary 03D35, 03D30 |
Displaying result #1 - #100 of 25155 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|