Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
87 | Anna Nepomniaschaya |
Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PaCT ![In: Parallel Computing Technologies, 10th International Conference, PaCT 2009, Novosibirsk, Russia, August 31-September 4, 2009. Proceedings, pp. 257-268, 2009, Springer, 978-3-642-03274-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Directed weighted graph, subgraph of the shortest paths, decremental algorithm, associative parallel processor, access data by contents, adjacency matrix |
72 | Honorius Gâlmeanu, Razvan Andonie |
Implementation Issues of an Incremental and Decremental SVM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICANN (1) ![In: Artificial Neural Networks - ICANN 2008 , 18th International Conference, Prague, Czech Republic, September 3-6, 2008, Proceedings, Part I, pp. 325-335, 2008, Springer, 978-3-540-87535-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
72 | Amund Tveit, Magnus Lie Hetland, Håavard Engum |
Incremental and Decremental Proximal Support Vector Classification using Decay Coefficients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DaWaK ![In: Data Warehousing and Knowledge Discovery, 5th International Conference, DaWaK 2003, Prague, Czech Republic, September 3-5,2003, Proceedings, pp. 422-423, 2003, Springer, 3-540-40807-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
70 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 117-123, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
BFS tree, decremental, reachability |
55 | Khaled Boukharouba, Stéphane Lecoeuche |
Online Clustering of Non-stationary Data Using Incremental and Decremental SVM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICANN (1) ![In: Artificial Neural Networks - ICANN 2008 , 18th International Conference, Prague, Czech Republic, September 3-6, 2008, Proceedings, Part I, pp. 336-345, 2008, Springer, 978-3-540-87535-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
55 | Anna Nepomniaschaya |
Associative Version of Italiano's Decremental Algorithm for the Transitive Closure Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PaCT ![In: Parallel Computing Technologies, 9th International Conference, PaCT 2007, Pereslavl-Zalessky, Russia, September 3-7, 2007, Proceedings, pp. 442-452, 2007, Springer, 978-3-540-73939-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
55 | Nicolas Thibault, Christian Laforest |
An Optimal Rebuilding Strategy for a Decremental Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings, pp. 157-170, 2006, Springer, 3-540-35474-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
51 | Sung-Ryul Kim, Kunsoo Park |
A Dynamic Edit Distance Table. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings, pp. 60-68, 2000, Springer, 3-540-67633-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
38 | Chun Kit Chui, Ben Kao |
A Decremental Approach for Mining Frequent Itemsets from Uncertain Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 12th Pacific-Asia Conference, PAKDD 2008, Osaka, Japan, May 20-23, 2008 Proceedings, pp. 64-75, 2008, Springer, 978-3-540-68124-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
38 | Jeong Seok Oh, Hyun Woong Shin, Sang Ho Lee 0004 |
The Selection of Tunable DBMS Resources Using the Incremental/Decremental Relationship. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb/WAIM ![In: Advances in Data and Web Management, Joint 9th Asia-Pacific Web Conference, APWeb 2007, and 8th International Conference, on Web-Age Information Management, WAIM 2007, Huang Shan, China, June 16-18, 2007, Proceedings, pp. 366-373, 2007, Springer, 978-3-540-72483-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | José Arturo Olvera-López, Jesús Ariel Carrasco-Ochoa, José Francisco Martínez Trinidad |
Sequential Search for Decremental Edition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAL ![In: Intelligent Data Engineering and Automated Learning - IDEAL 2005, 6th International Conference, Brisbane, Australia, July 6-8, 2005, Proceedings, pp. 280-285, 2005, Springer, 3-540-26972-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Shichao Zhang 0001, Xindong Wu 0001, Jilian Zhang, Chengqi Zhang |
A Decremental Algorithm for Maintaining Frequent Itemsets in Dynamic Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DaWaK ![In: Data Warehousing and Knowledge Discovery, 7th International Conference, DaWaK 2005, Copenhagen, Denmark, August 22-26, 2005, Proceedings, pp. 305-314, 2005, Springer, 3-540-28558-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Fabrizio Grandoni 0001, Giuseppe F. Italiano |
Decremental Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, pp. 142-153, 2004, Springer, 3-540-24132-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Hyunsoo Kim, Haesun Park |
Incremental and Decremental Least Squares Support Vector Machine and Its Application to Drug Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSB ![In: 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, CSB 2004, Stanford, CA, USA, August 16-19, 2004, pp. 656-657, 2004, IEEE Computer Society, 0-7695-2194-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri |
Distributed Protocols for Finding Low-Cost Broadcast and Multicast Trees in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SECON ![In: Proceedings of the Fifth Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2008, June 16-20, 2008, Crowne Plaza, San Francisco International Airport, California, USA, pp. 551-559, 2008, IEEE, 978-1-4244-1777-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Michael Elkin |
Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 716-727, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Shu Yu, Xiaowei Yang, Zhifeng Hao, Yanchun Liang |
An Adaptive Support Vector Machine Learning Algorithm for Large Classification Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2006, Third International Symposium on Neural Networks, Chengdu, China, May 28 - June 1, 2006, Proceedings, Part I, pp. 981-990, 2006, Springer, 3-540-34439-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Liam Roditty, Uri Zwick |
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 499-508, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Yaowei Long, Yunfan Wang |
Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.09150, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Deeksha Adil, Thatchaphol Saranurak |
Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.17929, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan 0001, Peter Strulo |
Decremental Sensitivity Oracles for Covering and Packing Minors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 44:1-44:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Wenting Zou, Li Li 0064, Zichen Xu 0001, Dan Wu, Cheng-Zhong Xu 0001, Yuhao Wang 0001, Haoyang Zhu, Xiao Sun |
SmartDL: energy-aware decremental learning in a mobile-based federation for geo-spatial system. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 35(5), pp. 3677-3696, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Kapil Bhardwaj, Mayank Srivastava |
VDTA and DO-CCII based incremental/decremental floating memductance/meminductance simulator: A novel realization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Integr. ![In: Integr. 88, pp. 139-155, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Qingyang Dai, Chunhui Zhao 0001, Biao Huang 0001 |
Incremental Variational Bayesian Gaussian Mixture Model With Decremental Optimization for Distribution Accommodation and Fine-Scale Adaptive Process Monitoring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Cybern. ![In: IEEE Trans. Cybern. 53(8), pp. 5094-5107, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Bhawna Aggarwal, Shireesh Kumar Rai, Akanksha Arora, Amaan Siddiqui, Rupam Das |
A Floating Decremental/ Incremental Meminductor Emulator Using Voltage Differencing Inverted Buffered Amplifier and Current Follower. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Circuits Syst. Comput. ![In: J. Circuits Syst. Comput. 32(14), pp. 2350243:1-2350243:32, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou 0001 |
Decremental optimization of vertex-colouring under the reconfiguration framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. Comput. Syst. Theory ![In: Int. J. Comput. Math. Comput. Syst. Theory 8(1), pp. 80-92, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Jiantao Wu, Shentong Mo, Muhammad Awais 0001, Sara Atito, Xingshen Zhang, Lin Wang 0004, Xiang Yang |
Variantional autoencoder with decremental information bottleneck for disentanglement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.12959, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Jiale Chen, Aaron Sidford, Ta-Wei Tu |
Entropy Regularization and Faster Decremental Matching in General Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.09077, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Aditi Dudeja |
Decremental Matching in General Weighted Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.08996, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Saroj S. Shivagunde, V. Vijaya Saradhi |
View incremental decremental multi-view discriminant analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 53(11), pp. 13593-13607, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Julia Chuzhoy |
A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2122-2213, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Shiri Chechik, Tianyi Zhang 0008 |
Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 87-99, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup |
Optimal Decremental Connectivity in Non-Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, pp. 6:1-6:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-278-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Li-Jun Chen, Teng Zhang 0001, Xuanhua Shi, Hai Jin 0001 |
Incremental and Decremental Optimal Margin Distribution Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pp. 3523-3531, 2023, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Jiantao Wu, Shentong Mo, Xingshen Zhang, Muhammad Awais 0001, Sara Ahmed, Zhenhua Feng, Lin Wang 0004, Xiang Yang |
Variational Autoencoders with Decremental Information Bottleneck for Disentanglement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BMVC ![In: 34th British Machine Vision Conference 2023, BMVC 2023, Aberdeen, UK, November 20-24, 2023, pp. 433-436, 2023, BMVA Press. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
20 | Wenrao Pang, Gang Wu |
Fast algorithms for incremental and decremental semi-supervised discriminant analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Recognit. ![In: Pattern Recognit. 131, pp. 108888, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Jiahua Dong 0001, Yang Cong, Gan Sun, Tao Zhang 0084, Xu Tang, Xiaowei Xu 0001 |
Evolving Metric Learning for Incremental and Decremental Features. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Circuits Syst. Video Technol. ![In: IEEE Trans. Circuits Syst. Video Technol. 32(4), pp. 2290-2302, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian |
Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.12721, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Sepehr Assadi, Aaron Bernstein, Aditi Dudeja |
Decremental Matching in General Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.00927, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos |
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.01152, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Julia Chuzhoy |
A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.10556, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Pratik Kumar, Sajal K. Paul |
High-Frequency Tunable Grounded & Floating Incremental-Decremental Meminductor Emulator and Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.06221, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Honorius Gâlmeanu, Razvan Andonie |
Weighted Incremental-Decremental Support Vector Machines for concept drift with shifting window. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Networks ![In: Neural Networks 152, pp. 528-541, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Ming Yan, Yuanyuan Pu, Pengzheng Zhao, Dan Xu 0001, Hao Wu, Qiuxia Yang, Ruxin Wang 0002 |
Abstract Painting Synthesis via Decremental optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Graph. Forum ![In: Comput. Graph. Forum 41(7), pp. 419-430, October 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Andrzej Jaszkiewicz, Piotr Zielniewicz |
Greedy Decremental Quick Hypervolume Subset Selection Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN (2) ![In: Parallel Problem Solving from Nature - PPSN XVII - 17th International Conference, PPSN 2022, Dortmund, Germany, September 10-14, 2022, Proceedings, Part II, pp. 164-178, 2022, Springer, 978-3-031-14720-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian |
Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France., pp. 77:1-77:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-235-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Sepehr Assadi, Aaron Bernstein, Aditi Dudeja |
Decremental Matching in General Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France., pp. 11:1-11:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-235-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Jakub Lacki, Yasamin Nazari |
Near-Optimal Decremental Hopsets with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France., pp. 86:1-86:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-235-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Rasha Kashef 0001 |
A boosted SVM classifier trained by incremental learning and decremental unlearning approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 167, pp. 114154, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Geunseop Lee |
Fast and more accurate incremental-decremental principal component analysis algorithm for online learning of face recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electronic Imaging ![In: J. Electronic Imaging 30(4), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | John Vista, Ashish Ranjan 0002 |
Flux Controlled Floating Memristor Employing VDTA: Incremental or Decremental Operation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 40(2), pp. 364-372, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Julia Chuzhoy |
Decremental All-Pairs Shortest Paths in Deterministic Near-Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.05621, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Giovanni Cherubin, Konstantinos Chatzikokolakis 0001, Martin Jaggi |
Exact Optimization of Conformal Predictors via Incremental and Decremental Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.03236, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Wenting Zou, Li Li 0064, Zichen Xu 0001, Chengzhong Xu 0001 |
DEAL: Decremental Energy-Aware Learning in a Federated System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.03051, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.07149, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup |
Optimal Decremental Connectivity in Non-Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.09376, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Chuxin Wang, Haoran Mo |
Learning Deep Attention Network from Incremental and Decremental Features for Evolving Features. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. Program. ![In: Sci. Program. 2021, pp. 1492828:1-1492828:8, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Julia Chuzhoy, Thatchaphol Saranurak |
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pp. 2478-2496, 2021, SIAM, 978-1-61197-646-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pp. 1000-1008, 2021, IEEE, 978-1-6654-2055-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 64:1-64:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Jacob Holm, Eva Rotenberg |
Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 42:1-42:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Julia Chuzhoy |
Decremental all-pairs shortest paths in deterministic near-linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 626-639, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou 0001 |
Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings, pp. 355-366, 2021, Springer, 978-3-030-89542-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Giovanni Cherubin, Konstantinos Chatzikokolakis 0001, Martin Jaggi |
Exact Optimization of Conformal Predictors via Incremental and Decremental Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event., pp. 1836-1845, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Alexandre Reeberg de Mello, Marcelo Ricardo Stemmer, Alessandro L. Koerich |
Incremental and decremental fuzzy bounded twin support vector machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 526, pp. 20-38, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Claudio Contardo |
Decremental Clustering for the Solution of p-Dispersion Problems to Proven Optimality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Optim. ![In: INFORMS J. Optim. 2(2), pp. 134-144, January 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Suchitra Gupta, Shireesh Kumar Rai |
New Grounded and Floating Decremental/Incremental Memristor Emulators Based on CDTA and Its Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Pers. Commun. ![In: Wirel. Pers. Commun. 113(2), pp. 773-798, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2001.10821, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Rui Zhou |
Tighter Bound Estimation of Sensitivity Analysis for Incremental and Decremental Data Modification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.03351, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2001.10809, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Jakub Lacki, Yasamin Nazari |
Near-Optimal Decremental Approximate Multi-Source Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.08416, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.04496, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.02584, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Hufei Zhu |
Efficient Inverse-Free Incremental and Decremental Algorithms for Multiple Hidden Nodes in Extreme Learning Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.13023, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Julia Chuzhoy, Thatchaphol Saranurak |
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.08479, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Decremental APSP in Directed Graphs Versus an Adaptive Adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2010.00937, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Jiahua Dong 0001, Yang Cong, Gan Sun, Tao Zhang 0084, Xiaowei Xu 0001 |
Evolving Metric Learning for Incremental and Decremental Features. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.15334, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020., pp. 2522-2541, 2020, SIAM, 978-1-61197-599-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020., pp. 2542-2561, 2020, SIAM, 978-1-61197-599-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pp. 1112-1122, 2020, IEEE, 978-1-7281-9621-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pp. 1123-1134, 2020, IEEE, 978-1-7281-9621-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Alexandre Blanché, Haruka Mizuta, Paul Ouvrard, Akira Suzuki |
Decremental Optimization of Dominating Sets Under the Reconfiguration Framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings, pp. 69-82, 2020, Springer, 978-3-030-48965-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Joseph Ross |
Incremental-decremental rolling window double exponential smoothing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. Stat. Simul. Comput. ![In: Commun. Stat. Simul. Comput. 48(10), pp. 3078-3091, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Julia Chuzhoy, Sanjeev Khanna |
A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.11512, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
20 | Alexandre Blanché, Haruka Mizuta, Paul Ouvrard, Akira Suzuki |
Decremental Optimization of Dominating Sets Under Reachability Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1906.05163, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
20 | Naveed Iqbal 0003, Waqas Ahmad, Christian Schneider 0003, Reiner S. Thomä |
Lower Bound on the Sum-rate of Decremental Beam Selection Algorithm for Beamspace MIMO Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.10702, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
20 | Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen |
Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.03615, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
20 | Alexandre Reeberg de Mello, Marcelo Ricardo Stemmer, Alessandro Lameiras Koerich |
Incremental and Decremental Fuzzy Bounded Twin Support Vector Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.09613, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
20 | Hufei Zhu |
Efficient Decremental Learning Algorithms for Broad Learning System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1912.13169, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
20 | Matteo Zavatteri, Luca Viganò 0001 |
Last man standing: Static, decremental and dynamic resiliency via controller synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Secur. ![In: J. Comput. Secur. 27(3), pp. 343-373, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Yuantao Chen, Jie Xiong, Weihong Xu, Jingwen Zuo |
A novel online incremental and decremental learning algorithm based on variable support vector machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Clust. Comput. ![In: Clust. Comput. 22(Supplement), pp. 7435-7445, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Wei-Han Lee, Bong Jun Ko, Shiqiang Wang 0001, Changchang Liu, Kin K. Leung |
Exact Incremental and Decremental Learning for LS-SVM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: 2019 IEEE International Conference on Image Processing, ICIP 2019, Taipei, Taiwan, September 22-25, 2019, pp. 2334-2338, 2019, IEEE, 978-1-5386-6249-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Jeevan Sirkunan, Nasir Shaikh-Husin, Muhammad N. Marsono |
Interleaved Incremental/Decremental Support Vector Machine for Embedded System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS ![In: IEEE International Symposium on Circuits and Systems, ISCAS 2019, Sapporo, Japan, May 26-29, 2019, pp. 1-5, 2019, IEEE, 978-1-7281-0397-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Julia Chuzhoy, Sanjeev Khanna |
A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019., pp. 389-400, 2019, ACM, 978-1-4503-6705-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen |
Decremental strongly-connected components and single-source reachability in near-linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019., pp. 365-376, 2019, ACM, 978-1-4503-6705-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Deokjae Lee, S. Hwang, Sangmin Choi, B. Kahng |
Decremental dynamic algorithm to trace mutually connected clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoftwareX ![In: SoftwareX 7, pp. 273-280, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 65(6), pp. 36:1-36:40, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Jacob Holm, Eva Rotenberg |
Good r-divisions Imply Optimal Amortised Decremental Biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.02568, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
20 | Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg |
Decremental SPQR-trees for Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1806.10772, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
20 | Chenping Hou, Zhi-Hua Zhou |
One-Pass Learning with Incremental and Decremental Features. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 40(11), pp. 2776-2792, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|