|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 36 occurrences of 24 keywords
|
|
|
Results
Found 45 publication records. Showing 45 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
93 | Marie-Laurence Mazure |
A few remarks on recurrence relations for geometrically continuous piecewise Chebyshevian B-splines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 51(4), pp. 401-428, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Chebyshev spaces, Connexion matrices, de Boor algorithm, B-splines, Recurrence relations, Blossoms, Geometric design |
91 | Marie-Laurence Mazure |
Pseudoaffinity, de Boor algorithm, and blossoms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 26(1-3), pp. 305-322, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics subject classification (2000) 65D17 |
70 | Paul S. Bonsma, Florian Zickfeld |
Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 531-543, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
70 | Marie-Laurence Mazure |
Blossoms and Optimal Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 20(1-3), pp. 177-203, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
B-spline basis, corner cutting algorithms, extended Chebyshev spaces, Chebyshev blossoming, blossoming, total positivity, Bernstein basis |
70 | Marie-Laurence Mazure |
Chebyshev spaces with polynomial blossoms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 10(3-4), pp. 219-238, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Chebyshev spaces, degree elevation, subdivision, shape parameters, 65D17, blossoming, geometric design |
49 | Wen Gao 0001, Lionel M. Ni, Zhiwei Xu, S. C. Cheung 0001, Li Cui, Qiong Luo 0001 |
BLOSSOMS: Building Lightweight Optimized Sensor Systems on a Massive Scale. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 20(1), pp. 105-177, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
sensor network, middleware, communication protocol, network simulation, network monitor, sensor node |
49 | Lionel M. Ni, Li Cui, Qiong Luo 0001, Hoilun Ngan, Ze Zhao |
Status of the CAS/HKUST Joint Project BLOSSOMS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2005), 17-19 August 2005, Hong Kong, China, pp. 469-474, 2005, IEEE Computer Society, 0-7695-2346-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
49 | Wen Gao 0001, Lionel M. Ni, Zhiwei Xu |
BLOSSOMS: A CAS/HKUST Joint Project to Build Lightweight Optimized Sensor Systems on a Massive Scale. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NPC ![In: Network and Parallel Computing, IFIP International Conference, NPC 2004, Wuhan, China, October 18-20, 2004, Proceedings, pp. 559-564, 2004, Springer, 3-540-23388-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Tom Lyche, Marie-Laurence Mazure |
Total positivity and the existence of piecewise exponential B-splines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 25(1-3), pp. 105-133, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Chebyshev systems, piecewise exponential splines, B-spline basis, blossoms, total positivity |
29 | Harold N. Gabow, Robert Endre Tarjan |
Faster Scaling Algorithms for General Graph-Matching Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 38(4), pp. 815-853, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
augmenting path, blossoms matching, network optimisation, scaling |
29 | 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 |
28 | Siti Nazleen Abdul Rabu, Siti Khadijah Mohamad, Samer A. B. Awwad, Nurul Halimatul Asmak Ismail, Kang Seua Yeen |
Effectiveness of inquiry-based learning with the aid of BLOSSOMS video on students' performance and motivation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Educ. Inf. Technol. ![In: Educ. Inf. Technol. 28(9), pp. 11469-11494, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Mario Villalobos, Ronnie Videla |
The roots and blossoms of 4E cognition in Chile: Introduction to the Special Issue on 4E cognition in Chile. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adapt. Behav. ![In: Adapt. Behav. 31(5), pp. 397-404, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Alyn Rockwood |
Splossoms: Spherical Blossoms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CGI (4) ![In: Advances in Computer Graphics - 40th Computer Graphics International Conference, CGI 2023, Shanghai, China, August 28 - September 1, 2023, Proceedings, Part IV, pp. 200-209, 2023, Springer, 978-3-031-50077-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Tomonari Horikawa, Munenori Takahashi, Masaki Endo, Shigeyoshi Ohno, Masaharu Hirota, Hiroshi Ishikawa 0004 |
Estimating the Best Time to View Cherry Blossoms Using Time-Series Forecasting Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. Knowl. Extr. ![In: Mach. Learn. Knowl. Extr. 4(2), pp. 418-431, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
28 | Shuya Funada, Narumasa Tsutsumida |
Mapping Cherry Blossoms from Geotagged Street-Level Photos. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IGARSS ![In: IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2022, Kuala Lumpur, Malaysia, July 17-22, 2022, pp. 5645-5647, 2022, IEEE, 978-1-6654-2792-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
28 | Takashi Nonaka, Tomohito Asaka, Toshiro Sugimura, Keishi Iwashita |
Relationships Between the Flowering Date of Cherry Blossoms in Japan and Eight-Day Land Surface Temperature Derived from GCOM-C/SGLI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IGARSS ![In: IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2022, Kuala Lumpur, Malaysia, July 17-22, 2022, pp. 3636-3639, 2022, IEEE, 978-1-6654-2792-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
28 | Chizumi Shimamura, Peeraya Sripian, Midori Sugaya |
Blossoms: Preliminary Experiment on Sharing Empathy Online. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HCI (1) ![In: Human-Computer Interaction. Theory, Methods and Tools - Thematic Area, HCI 2021, Held as Part of the 23rd HCI International Conference, HCII 2021, Virtual Event, July 24-29, 2021, Proceedings, Part I, pp. 375-383, 2021, Springer, 978-3-030-78461-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
28 | R. Swathika, T. Sree Sharmila |
Multi-model fusion based satellite image classification using versatile unsupervised vector zone (VUVZ) fusion and intensive pragmatic blossoms (IPB) technique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multim. Tools Appl. ![In: Multim. Tools Appl. 79(5-6), pp. 4239-4260, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
28 | Shin Nagai, Hiroshi Morimoto, Taku M. Saitoh |
A simpler way to predict flowering and full bloom dates of cherry blossoms by self-organizing maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ecol. Informatics ![In: Ecol. Informatics 56, pp. 101040, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
28 | Philip Engelbutzeder, Katerina Cerná, Dave Randall 0001, Dennis Lawo, Claudia Müller 0002, Gunnar Stevens, Volker Wulf |
Investigating the use of digital artifacts in a community project of sustainable food practices: 'My chili blossoms'. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NordiCHI ![In: NordiCHI '20: Shaping Experiences, Shaping Society, Proceedings of the 11th Nordic Conference on Human-Computer Interaction, Tallinn, Estonia, 25-29 October, 2020, pp. 107:1-107:4, 2020, ACM, 978-1-4503-7579-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
28 | Andre Droschinsky, Petra Mutzel, Erik Thordsen |
Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 146-160, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
28 | Wan Akmal Izzati Wan Mohd Zawawi, Khairiyah Binti Mohd Yusof, Nur Fazirah Jumari, Nor Azlinda Azmi, Tengku Nur Zulaikha Tengku Malim Busu |
Implication of Active Learning Techniques in Learning Thermodynamics Energy Conversion using BLOSSOMS Thermodynamics Energy Conversion Video towards Engineering Undergraduates Performance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Emerg. Technol. Learn. ![In: Int. J. Emerg. Technol. Learn. 14(24), pp. 121-130, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
28 | Ágnes Bogárdi-Mészöly, András Rövid, Shohei Yokoyama |
Detect Scenic Leaves and Blossoms Viewing Places from Flickr Based on Social and Image Features. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IIAI-AAI ![In: 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016, Kumamoto, Japan, July 10-14, 2016, pp. 1162-1167, 2016, IEEE Computer Society, 978-1-4673-8985-3. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Marc Langheinrich, Nigel Davies 0001 |
From Fishing Trips in Alaska to Cherry Blossoms in Japan: Martin Källström's Take on Wearable Cameras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Pervasive Comput. ![In: IEEE Pervasive Comput. 14(3), pp. 56-61, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
28 | Norbert Blum |
Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1509.04927, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
28 | Rob Jansen, John Geddes, Chris Wacek, Micah Sherr, Paul F. Syverson |
Never Been KIST: Tor's Congestion Management Blossoms with Kernel-Informed Socket Transport. ![Search on Bibsonomy](Pics/bibsonomy.png) |
USENIX Security Symposium ![In: Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014., pp. 127-142, 2014, USENIX Association. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
28 | Vijay V. Vazirani |
An Improved Definition of Blossoms and a Simpler Proof of the MV Matching Algorithm ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1210.4594, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
28 | Marie-Laurence Mazure |
Dimension elevation formula for Chebyshevian blossoms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Aided Geom. Des. ![In: Comput. Aided Geom. Des. 26(9), pp. 1016-1027, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | L. Yohanes Stefanus |
Surface representations using blossoms and buds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Shape Modeling International ![In: 2008 International Conference on Shape Modeling and Applications (SMI 2008), June 4-6, 2008, Stony Brook, NY, USA, pp. 139-145, 2008, IEEE Computer Society, 978-1-4244-2260-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | L. Yohanes Stefanus |
Shape Representations with Blossoms and Buds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Geometric Modeling and Processing - GMP 2006, 4th International Conference, Pittsburgh, PA, USA, July 26-28, 2006, Proceedings, pp. 397-408, 2006, Springer, 3-540-36711-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Marie-Laurence Mazure |
Blossoms of generalized derivatives in Chebyshev spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Approx. Theory ![In: J. Approx. Theory 131(1), pp. 47-58, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Rachid Ait-Haddou, Luc Biard, Michael A. Slawinski |
Minimizing blossoms under symmetric linear constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Aided Geom. Des. ![In: Comput. Aided Geom. Des. 19(6), pp. 421-431, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Ron Goldman 0002 |
The rational Bernstein bases and the multirational blossoms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Aided Geom. Des. ![In: Comput. Aided Geom. Des. 16(8), pp. 701-738, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
28 | E. T. Y. Lee |
Computing a chain of blossoms, with application to products of splines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Aided Geom. Des. ![In: Comput. Aided Geom. Des. 11(6), pp. 597-620, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
28 | Vijay V. Vazirani |
A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(sqrt{V E}) General Graph Maximum Matching Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 14(1), pp. 71-109, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
28 | Raul Gormaz Arancibia |
Floraisons polynomiales : applications à l'étude des B-splines à plusieurs variables. (Polynomial blossoms : its application to the study of multivariate B-splines). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1993 |
RDF |
|
28 | Vijay V. Vazirani |
A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, Waterloo, Ontorio, Canada, May 28-30 1990, pp. 509-530, 1990, University of Waterloo Press, 0-88898-099-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP BibTeX RDF |
|
28 | Lyle Ramshaw |
Blossoms are polar forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Aided Geom. Des. ![In: Comput. Aided Geom. Des. 6(4), pp. 323-358, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
21 | Marie-Laurence Mazure |
Bernstein-type operators in Chebyshev spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 52(1), pp. 93-128, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 41A35, 41A50, 65D17 |
21 | Márton Makai, Gyula Pap, Jácint Szabó |
Matching Problems in Polymatroids Without Double Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings, pp. 167-181, 2007, Springer, 978-3-540-72791-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
matroids and submodular functions |
21 | David von Oheimb |
Formal Methods in the Security Business: Exotic Flowers Thriving in an Expanding Niche. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FM ![In: FM 2006: Formal Methods, 14th International Symposium on Formal Methods, Hamilton, Canada, August 21-27, 2006, Proceedings, pp. 592-597, 2006, Springer, 3-540-37215-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
security, models, evaluation, software engineering, Formal methods |
21 | Ventsi G. Rumchev |
Positive Linear Systems Reachability Criterion in Digraph Form. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POSTA ![In: Positive Systems, Proceedings of the First Multidisciplinary International Symposium on Positive Systems: Theory and Applications (POSTA 2003), Rome, Italy, August 28-30, 2003, pp. 241-248, 2003, Springer, 3-540-40342-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Marie-Laurence Mazure |
Chebyshev splines beyond total positivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 14(2), pp. 129-156, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Chebyshev spaces, Chebyshev blossoming, connection matrices, B-splines, shape parameters, total positivity |
21 | Marie-Laurence Mazure |
Vandermonde type determinants and blossoming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 8(4), pp. 291-315, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Chebyshev spaces, Chebyshev blossoming, degree elevation, Vandermonde determinants, shape parameters, 65D17 |
Displaying result #1 - #45 of 45 (100 per page; Change: )
|
|