Search results for "sparse-tree"

Found 19 publication records. Showing 19 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
38	Harry Buhrman, Leen Torenvliet, Falk Unger	Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds.	STACS	2006	DBLP DOI BibTeX RDF	Selfreducibility, Computational Complexity, Sparseness
24	Dong-Yu Zheng, Yan Sun, Shao-Qing Li, Liang Fang	A 485ps 64-Bit Parallel Adder in 0.18mum CMOS.	J. Comput. Sci. Technol.	2007	DBLP DOI BibTeX RDF	semi-dynamic, sparse-tree, parallel prefix adder
20	Amir Agah, Seid Mehdi Fakhraie, Azita Emami-Neyestanak	Tertiary-Tree 12-GHz 32-bit Adder in 65nm Technology.	ISCAS	2007	DBLP DOI BibTeX RDF
18	Chinh La, Minh N. Do	Tree-Based Orthogonal Matching Pursuit Algorithm for Signal Reconstruction.	ICIP	2006	DBLP DOI BibTeX RDF
16	Johannes Grad, James E. Stine	Dual-Mode High-Speed Low-Energy Binary Addition.	ISVLSI	2006	DBLP DOI BibTeX RDF
15	Huy Quang Bui, C. N. H. La, Minh N. Do	A fast tree-based algorithm for Compressed Sensing with sparse-tree prior.	Signal Process.	2015	DBLP DOI BibTeX RDF
10	Patrick Lutz, Ludovic Arnould, Claire Boyer, Erwan Scornet	Sparse tree-based Initialization for Neural Networks.	ICLR	2023	DBLP BibTeX RDF
10	Brian Liu, Miaolan Xie, Haoyue Yang, Madeleine Udell	ControlBurn: Nonlinear Feature Selection with Sparse Tree Ensembles.	CoRR	2022	DBLP DOI BibTeX RDF
10	Patrick Lutz, Ludovic Arnould, Claire Boyer, Erwan Scornet	Sparse tree-based initialization for neural networks.	CoRR	2022	DBLP DOI BibTeX RDF
10	Michael H. Lim, Claire J. Tomlin, Zachary N. Sunberg	Sparse Tree Search Optimality Guarantees in POMDPs with Continuous Observation Spaces.	IJCAI	2020	DBLP DOI BibTeX RDF
10	Michael H. Lim, Claire J. Tomlin, Zachary N. Sunberg	Sparse tree search optimality guarantees in POMDPs with continuous observation spaces.	CoRR	2019	DBLP BibTeX RDF
10	Abdulaziz S. Alsayyari, Abdallah Aldosary	Path Loss Results for Wireless Sensor Network Deployment in a Sparse Tree Environment.	ISNCC	2019	DBLP DOI BibTeX RDF
10	Olzhas Adiyatov, Kazbek Sultanov, Olzhas Zhumabek, Huseyin Atakan Varol	Sparse tree heuristics for RRT* family motion planners.	AIM	2017	DBLP DOI BibTeX RDF
10	Rudy Cahyadi Hario Pribadi, Hsing-Kuo Pao	Sparse tree structured representation for re-identification.	Pattern Recognit.	2016	DBLP DOI BibTeX RDF
10	Weijia Wang, Yong Li 0002, Lei Hu, Li Lu 0001	Storage-Awareness: RFID Private Authentication based on Sparse Tree.	SECPerU	2007	DBLP DOI BibTeX RDF
10	Sanu Mathew, Mark A. Anders 0001, Ram K. Krishnamurthy, Shekhar Borkar	A 4-GHz 130-nm address generation unit with 32-bit sparse-tree adder core.	IEEE J. Solid State Circuits	2003	DBLP DOI BibTeX RDF
10	Elias Dahlhaus	Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representations.	HICSS (2)	1994	DBLP BibTeX RDF
7	Sreehari Veeramachaneni, Kirthi M. Krishna, Lingamneni Avinash, Reddy Puppala Sreekanth, M. B. Srinivas	Novel High-Speed Redundant Binary to Binary converter using Prefix Networks.	ISCAS	2007	DBLP DOI BibTeX RDF
7	Wayne D. Grover, John Doucette 0001	Topological Design of Survivable Mesh-Based Transport Networks.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	restorable networks, restoration and protection, capacity design, heuristics, mesh networks, survivability, WDM, topology design, Sonet