Search results for "R-trees"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
32	Ibrahim F. Imam, Ryszard S. Michalski	Should Decision Trees be Learned from Examples of from Decision Rules?	ISMIS	1993	DBLP DOI BibTeX RDF	machine learning, decision trees, inductive learning, decision rules
32	Josef Grosch	Transformation of Attributed Trees Using Pattern Matching.	CC	1992	DBLP DOI BibTeX RDF	attributed trees, pattern matching, transformation
31	Tai-Wei Chiang, Te-Lun Mai, Trees-Juen Chuang	CircMiMi: a stand-alone software for constructing circular RNA-microRNA-mRNA interactions across species.	BMC Bioinform.	2022	DBLP DOI BibTeX RDF
31	Ronald I. Greenberg, Julie Medero, Samuel A. Rebelsky, Frances P. Trees, Dale Reed	The Impact of CS for All on College Placement in Computer Science.	SIGCSE	2020	DBLP DOI BibTeX RDF
31	Chia-Ying Chen, Trees-Juen Chuang	NCLcomparator: systematically post-screening non-co-linear transcripts (circular, trans-spliced, or fusion RNAs) identified from various detectors.	BMC Bioinform.	2019	DBLP DOI BibTeX RDF
31	Chia-Ying Chen, Trees-Juen Chuang	Comment on "A comprehensive overview and evaluation of circular RNA detection tools".	PLoS Comput. Biol.	2019	DBLP DOI BibTeX RDF
31	Jeff Gray 0001, Kathy Haynie, Fran Trees, Owen L. Astrachan, Chinma Uche, Siobhan Cooney, Richard Kick	Infusing Cooperative Learning into AP Computer Science Principles Courses to Promote Engagement and Diversity.	SIGCSE	2019	DBLP DOI BibTeX RDF
31	Lien Diaz, Frances P. Trees, Dale Reed, Richard Kick, Andrew Kuemmel	Social Justice and Equity in CS Education: Inaugural Launch of AP Computer Science Principles.	SIGCSE	2017	DBLP DOI BibTeX RDF
31	Owen L. Astrachan, Jeff Gray 0001, Fran Trees	Infusing Cooperative Learning into Early Computer Science Courses to Support Improved Engagement (Abstract Only).	SIGCSE	2016	DBLP DOI BibTeX RDF
31	Richard Kick, Frances P. Trees	AP CS principles: engaging, challenging, and rewarding.	Inroads	2015	DBLP DOI BibTeX RDF
31	Aidan Trees, Kevin Danaher, Zach Siatkowski, Darren Lim, Tom Heritage	Siena College's Institute of Artificial Intelligence TREC 2015 Contextual Suggestion Track.	TREC	2015	DBLP BibTeX RDF
31	Owen L. Astrachan, Lien Diaz, Amy Briggs, Fran Trees, Richard Kick	Computer Science Principles: Expanding the Community (Abstract Only).	SIGCSE	2015	DBLP DOI BibTeX RDF
31	Jeff Gray 0001, Fran Trees, Owen L. Astrachan	Infusing Cooperative Learning into Early Computer Science Courses to Support Improved Engagement (Abstract Only).	SIGCSE	2015	DBLP DOI BibTeX RDF
31	Paul T. Tymann, Frances P. Trees, Lester L. Wainwright, Richard Kick, Sandy Czajka, Andrew Kuemmel, Lien Diaz	Achieving a shared goal with AP Computer Science A and AP Computer Science Principles.	SIGCSE	2015	DBLP DOI BibTeX RDF
31	David Reed, Frances P. Trees	Addressing Professional Development Needs for K-12 CS: Working with Your Local CSTA Chapter (Abstract Only).	SIGCSE	2015	DBLP DOI BibTeX RDF
31	Frances P. Trees, Lissa Clayborn	CSTA chapters: building a CS community (abstract only).	SIGCSE	2014	DBLP DOI BibTeX RDF
31	Paul T. Tymann, Frances P. Trees, Robert Glen Martin, Richard Kick, Lien Diaz	Advanced placement computer science: AP computer science a and AP computer science principles.	SIGCSE	2014	DBLP DOI BibTeX RDF
31	Frances P. Trees, David Reed, Tammy Pirmann	CSTA chapters: supporting your local computer science educators (abstract only).	SIGCSE	2013	DBLP DOI BibTeX RDF
31	Jonas De Vylder, Jan Aelterman, Mado Vandewoestyne, Trees Lepez, Dieter Deforce, Wilfried Philips	Cell Nuclei Detection Using Globally Optimal Active Contours with Shape Prior.	ISVC (2)	2012	DBLP DOI BibTeX RDF
31	Frances P. Trees, Helen H. Hu, Chinma Uche	CSTA chapters: supporting your local computer science educators (abstract only).	SIGCSE	2012	DBLP DOI BibTeX RDF
31	Robert Arnone, Giulietta S. Fargion, Menghua Wang, Paul Martinolich, Curt H. Davis, Charles Trees, Sherwin Ladner, Adam Lawson, Giuseppe Zibordi, Zhong Ping Lee, Michael Ondrusek, Samuel Ahmed	Ocean Color products from Visible Infared Imager Radiometer Suite (VIIRS).	IGARSS	2012	DBLP DOI BibTeX RDF
31	Anita Verno, Brian Fuschetto, Frances P. Trees	CSTA national standards and their impact on the future of K-12 computer education.	SIGITE Conference	2011	DBLP DOI BibTeX RDF
31	Raffaele Grasso, Marco Cococcioni, Michel Rixen, Charles Trees, Alberto Baldacci	A generic decision support architecture for maritime operations.	Int. J. Intell. Def. Support Syst.	2010	DBLP DOI BibTeX RDF
31	Feng-Chi Chen, Yen-Zho Chen, Trees-Juen Chuang	CNVVdb: a database of copy number variations across vertebrate genomes.	Bioinform.	2009	DBLP DOI BibTeX RDF
31	Nan Li, Michele H. Jackson, April R. Trees	Relating Online: Managing Dialectical Contradictions in Massively Multiplayer Online Role-Playing Game Relationships.	Games Cult.	2008	DBLP DOI BibTeX RDF
31	Giuliana Pennucci, Raffaele Grasso, Charles Trees	A Study for Near-Shore Characterization Using High-Resolution Hyperspectral and Multispectral Images.	IGARSS (2)	2008	DBLP DOI BibTeX RDF
31	Feng-Chi Chen, Chuang-Jong Chen, Trees-Juen Chuang	INDELSCAN: a web server for comparative identification of species-specific and non-species-specific insertion/deletion events.	Nucleic Acids Res.	2007	DBLP DOI BibTeX RDF
31	Feng-Chi Chen, Chuang-Jong Chen, Jar-Yi Ho, Trees-Juen Chuang	Identification and evolutionary analysis of novel exons and alternative splicing events using cross-species EST-to-genome comparisons in human, mouse and rat.	BMC Bioinform.	2006	DBLP DOI BibTeX RDF
31	Feng-Chi Chen, Trees-Juen Chuang	The effects of multiple features of alternatively spliced exons on the KA/KS ratio test.	BMC Bioinform.	2006	DBLP DOI BibTeX RDF
31	Eric S. Roberts, Kim B. Bruce, James H. Cross II, Robb Cutler, Scott Grissom, Karl J. Klee, Susan H. Rodger, Fran Trees, Ian Utting, Frank Yellin	The ACM java task force: final report.	SIGCSE	2006	DBLP DOI BibTeX RDF	java, computer science education, CS1, teaching libraries
31	Feng-Chi Chen, Trees-Juen Chuang	ESTviewer: a web interface for visualizing mouse, rat, cattle, pig and chicken conserved ESTs in human genes and human alternatively spliced variants.	Bioinform.	2005	DBLP DOI BibTeX RDF
31	Eric S. Roberts, Kim B. Bruce, Robb Cutler, James H. Cross II, Scott B. Grissom, Karl J. Klee, Susan H. Rodger, Fran Trees, Ian Utting, Frank Yellin	The ACM java task force: status report.	SIGCSE	2005	DBLP DOI BibTeX RDF	Java, computer science education, CS1, teaching libraries
31	Trees-Juen Chuang, Feng-Chi Chen, Meng-Yuan Chou	A comparative method for identification of gene structures and alternatively spliced variants.	Bioinform.	2004	DBLP DOI BibTeX RDF
31	Wolfgang Weber, Trees Haaksma	Group D: The Role of Teachers: Lifelong Learners in a Community of Practice.	ICT and the Teacher of the Future	2003	DBLP BibTeX RDF
31	Harry L. Van Trees	Optimum Array Processing: Part IV of Detection, Estimation, and Modulation Theory		2002	DOI RDF
31	Russell Jeffers, Kristine L. Bell, Harry L. Van Trees	Broadband passive range estimation using music.	ICASSP	2002	DBLP DOI BibTeX RDF
31	John L. Schnase, James A. Smith, Thomas J. Stohlgren, Sara J. Graves, Charles Trees	Biological invasions: a challenge in ecological forecasting.	IGARSS	2002	DBLP DOI BibTeX RDF
31	Zhi Tian, Kristine L. Bell, Harry L. Van Trees	Robust constrained linear receivers for CDMA wireless systems.	IEEE Trans. Signal Process.	2001	DBLP DOI BibTeX RDF
31	Robert E. Zarnich, Kristine L. Bell, Harry L. Van Trees	A unified method for measurement and tracking of contacts from an array of sensors.	IEEE Trans. Signal Process.	2001	DBLP DOI BibTeX RDF
31	Zhi Tian, Kristine L. Bell, Harry L. Van Trees	A recursive least squares implementation for LCMP beamforming under quadratic constraint.	IEEE Trans. Signal Process.	2001	DBLP DOI BibTeX RDF
31	Zhi Tian, Kristine L. Bell, Harry L. Van Trees	Robust measures for decision feedback equalization in CDMA systems.	GLOBECOM	2001	DBLP DOI BibTeX RDF
31	Kristine L. Bell, Yariv Ephraim, Harry L. Van Trees	A Bayesian approach to robust adaptive beamforming.	IEEE Trans. Signal Process.	2000	DBLP DOI BibTeX RDF
31	Owen L. Astrachan, Robert Cartwight, Richard Kick, Cay S. Horstmann, Fran Trees, Gail Chapman, David Gries, Henry MacKay Walker, Ursula Wolz	Recommendations for changes in advanced placement computer science (panel session).	SIGCSE	2000	DBLP DOI BibTeX RDF
31	Andrew Turk, Kathryn Trees	Appropriate computer-mediated communication: An Australian indigenous information system case study.	AI Soc.	1999	DBLP DOI BibTeX RDF	Indigenous, Participative development, Postcolonial, Communication, Information systems, Culture, Ethics, Postmodern
31	Trees-Juen Chuang, Ja-Chen Lin	New approach to image encryption.	J. Electronic Imaging	1998	DBLP DOI BibTeX RDF
31	Trees-Juen Chuang, Ja-Chen Lin	A New Algorithm For Lossless Still Image Compression.	Pattern Recognit.	1998	DBLP DOI BibTeX RDF
31	Yariv Ephraim, Neri Merhav, Harry L. Van Trees	Authors' reply to "Comments on 'Min-Norm interpretations and consistency of MUSIC, MODE, and ML'".	IEEE Trans. Signal Process.	1998	DBLP DOI BibTeX RDF
31	Zhi Tian, Harry L. Van Trees	DOA estimation with hexagonal arrays.	ICASSP	1998	DBLP DOI BibTeX RDF
31	Kristine L. Bell, Yossef Steinberg, Yariv Ephraim, Harry L. Van Trees	Extended Ziv-Zakai lower bound for vector parameter estimation.	IEEE Trans. Inf. Theory	1997	DBLP DOI BibTeX RDF
31	Kristine L. Bell, Yariv Ephraim, Harry L. Van Trees	Robust adaptive beamforming using data dependent constraints.	ICASSP	1997	DBLP DOI BibTeX RDF
31	Kristine L. Bell, Yariv Ephraim, Harry L. Van Trees	Explicit Ziv-Zakai lower bound for bearing estimation.	IEEE Trans. Signal Process.	1996	DBLP DOI BibTeX RDF
31	Kristine L. Bell, Yariv Ephraim, Harry L. Van Trees	Explicit Ziv-Zakai lower bound for bearing estimation.	ICASSP	1996	DBLP DOI BibTeX RDF
31	Yariv Ephraim, Neri Merhav, Harry L. Van Trees	Min-norm interpretations and consistency of MUSIC, MODE and ML.	IEEE Trans. Signal Process.	1995	DBLP DOI BibTeX RDF
31	Yariv Ephraim, Harry L. Van Trees	A signal subspace approach for speech enhancement.	IEEE Trans. Speech Audio Process.	1995	DBLP DOI BibTeX RDF
31	Yariv Ephraim, Harry L. Van Trees	A spectrally-based signal subspace approach for speech enhancement.	ICASSP	1995	DBLP DOI BibTeX RDF
31	Kristine L. Bell, Yariv Ephraim, Harry L. Van Trees	Ziv-Zakai lower bounds in bearing estimation.	ICASSP	1995	DBLP DOI BibTeX RDF
31	Yariv Ephraim, Harry L. Van Trees	A signal subspace approach for speech enhancement.	ICASSP (2)	1993	DBLP DOI BibTeX RDF
31	Stephen P. Van Trees, Ophir Frieder	On the specification and implementation of X.25 using CSP and OCCAM.	Microprocessing and Microprogramming	1991	DBLP DOI BibTeX RDF
31	Harry L. Van Trees	Analog communication over randomly-time-varying channels.	IEEE Trans. Inf. Theory	1966	DBLP DOI BibTeX RDF
31	Harry L. Van Trees	Bounds on the accuracy attainable in the estimation of continuous random processes.	IEEE Trans. Inf. Theory	1966	DBLP DOI BibTeX RDF
31	Zhi-Jian (Alex) Mou, Francis Jutand	"Overturned-Stairs" Adder Trees and Multiplier Design.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	VLSI circuit layout, multioperand adders, Overturned-Stairs trees, 2's complement parallel multiplier, VLSI, logic design, digital arithmetic, trees (mathematics), adders, multiplying circuits, Wallace trees
31	Sakti Pramanik, Myoung-Ho Kim	Parallel Processing of Large Node B-Trees.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	large node B-trees, tree height, parallel algorithms, parallel processing, parallel processing, concurrency, trees (mathematics), response time, B-trees
31	Mike Sablatash	Designs and architectures of filter bank trees for spectrally efficient multi-user communications: review, modifications and extensions of wavelet packet filter bank trees.	Signal Image Video Process.	2008	DBLP DOI BibTeX RDF	Filter bank trees, Multi-user OFDM-type communication systems
31	Vincent Berry, François Nicolas	Maximum Agreement and Compatible Supertrees (Extended Abstract).	CPM	2004	DBLP DOI BibTeX RDF
31	Bruno Courcelle	Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas.	RTA	1999	DBLP DOI BibTeX RDF
31	Fritz Henglein, Jakob Rehof	Constraint Automata and the Complexity of Recursive Subtype Entailment.	ICALP	1998	DBLP DOI BibTeX RDF
31	Arvind Gupta, Naomi Nishimura	finding Smallest Supertrees.	ISAAC	1995	DBLP DOI BibTeX RDF
31	Philippe de Reffye, Claude Edelin, Jean Françon, Marc Jaeger 0002, Claude Puech	Plant models faithful to botanical structure and developmentr.	SIGGRAPH	1988	DBLP DOI BibTeX RDF	botany, database amplification, growth simulation, tree, plant
30	K. C. Reddy, Divya Nalla	Identity Based Authenticated Group Key Agreement Protocol.	INDOCRYPT	2002	DBLP DOI BibTeX RDF	key trees, one-way function trees, cryptography, elliptic curves, Key Agreement, group Key Agreement, Diffie-Hellman, Key Agreement Protocols, ID-based, Identity based, Weil pairing
30	Ricardo A. Baeza-Yates, Gaston H. Gonnet	Average Case Analysis of Algorithms using Matrix Recurrences.	ICCI	1990	DBLP DOI BibTeX RDF	average case, digital trees, matrix recurrences, Analysis of algorithms, search trees
30	Ravi S. Sandhu	Recognizing Immediacy in an N-Tree Hierarchy and Its Application to Protection Groups.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	immediacy, N-tree hierarchy, protection groups, subgroup relation, inverted rooted trees, access control, data structures, refinement, trees (mathematics), recursively, security of data, set theory, granularity, partial order, multi-access systems, linear orderings, integers
30	Bernhard Haeupler, Siddhartha Sen 0001, Robert Endre Tarjan	Rank-Balanced Trees.	WADS	2009	DBLP DOI BibTeX RDF
30	Karim Tabia, Salem Benferhat	On the Use of Decision Trees as Behavioral Approaches in Intrusion Detection.	ICMLA	2008	DBLP DOI BibTeX RDF
30	Igor Walukiewicz	Finding Your Way in a Forest: On Different Types of Trees and Their Properties.	FoSSaCS	2008	DBLP DOI BibTeX RDF
30	Arash Farzan, J. Ian Munro	A Uniform Approach Towards Succinct Representation of Trees.	SWAT	2008	DBLP DOI BibTeX RDF
30	Robert Endre Tarjan, Renato Fonseca F. Werneck	Dynamic Trees in Practice.	WEA	2007	DBLP DOI BibTeX RDF
30	Tassos Dimitriou	Securing Communication Trees in Sensor Networks.	ALGOSENSORS	2006	DBLP DOI BibTeX RDF
30	Luc Devroye	Random Multivariate Search Trees.	COLT	2006	DBLP DOI BibTeX RDF
30	Parthasarathi Dasgupta, Prashant Yadava	Linear Required-Arrival-Time Trees and their Construction.	VLSI Design	2006	DBLP DOI BibTeX RDF
30	Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan 0001	Structuring labeled trees for optimal succinctness, and beyond.	FOCS	2005	DBLP DOI BibTeX RDF
30	Daan Fierens, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe	A Comparison of Approaches for Learning Probability Trees.	ECML	2005	DBLP DOI BibTeX RDF
30	Chris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers	Computing the Quartet Distance Between Trees of Arbitrary Degree.	WABI	2005	DBLP DOI BibTeX RDF
30	Hideo Saito, Kenjiro Taura, Takashi Chikayama	Collective operations for wide-area message passing systems using adaptive spanning trees.	GRID	2005	DBLP DOI BibTeX RDF
30	Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul	On the Approximation of Computing Evolutionary Trees.	COCOON	2005	DBLP DOI BibTeX RDF
30	Juan José Rodríguez, Carlos J. Alonso	Interval and dynamic time warping-based decision trees.	SAC	2004	DBLP DOI BibTeX RDF
30	Jeroen Ketema	Böhm-Like Trees for Term Rewriting Systems.	RTA	2004	DBLP DOI BibTeX RDF
30	Eljas Soisalon-Soininen, Peter Widmayer	Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis.	Computer Science in Perspective	2003	DBLP DOI BibTeX RDF
30	Ganeshkumar Ganapathy, Tandy J. Warnow	Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees.	APPROX	2002	DBLP DOI BibTeX RDF
30	John Iacono	Alternatives to splay trees with O(log n) worst-case access times.	SODA	2001	DBLP BibTeX RDF
30	Vincent Ranwez, Olivier Gascuel	Phylogenetic Reconstruction Algorithms Based on Weighted 4-Trees.	JOBIM	2000	DBLP DOI BibTeX RDF
30	Yun-Chih Chang, Yao-Wen Chang, Guang-Ming Wu, Shu-Wei Wu	B*-Trees: a new representation for non-slicing floorplans.	DAC	2000	DBLP DOI BibTeX RDF
30	Wing-Kai Hon, Tak Wah Lam	Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees.	COCOON	1999	DBLP DOI BibTeX RDF
30	Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege	Analogs and Duals of the MAST Problem for Sequences and Trees.	ESA	1998	DBLP DOI BibTeX RDF
30	Kai Zercher	Constructing Decision Trees from Examples and Their Explanation-based Generalizations.	Expert Systems in Engineering	1990	DBLP DOI BibTeX RDF
30	Celso C. Ribeiro, Rodrigo F. Toso	Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights.	WEA	2007	DBLP DOI BibTeX RDF	DRD-trees, algorithms, data structures, Minimum spanning trees, dynamic graph algorithms, experimental analysis
30	Shan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung	Constructing Edge-Disjoint Spanning Trees in Product Networks.	IEEE Trans. Parallel Distributed Syst.	2003	DBLP DOI BibTeX RDF	Cartesian product networks, edge-disjoint trees, fault-tolerance, interconnection networks, embedding, spanning trees
30	Jennie C. Hansen, Eric Schmutz	Near-Optimal Bounded-Degree Spanning Trees.	Algorithmica	2001	DBLP DOI BibTeX RDF	Relaxed balance, Data structures, Search trees, AVL trees, Amortized analysis
30	Gopal Racherla, Sridhar Radhakrishnan, B. John Oommen	A New Geometric Tool for Pattern Recognition - An Algorithm for Real Time Insertion of Layered Segment Trees.	ICAPR	2001	DBLP DOI BibTeX RDF	pattern recognition of geometric objects, layered segment trees, segment trees
30	Mario A. Nascimento, Margaret H. Dunham	Indexing Valid Time Databases via B+-Trees.	IEEE Trans. Knowl. Data Eng.	1999	DBLP DOI BibTeX RDF	$rm B^+$-trees, indexing, Temporal databases, R-trees, access structures
30	T. Y. Chen, Y. Y. Cheung	Structural Properties of Post-Dominator Trees.	Australian Software Engineering Conference	1997	DBLP DOI BibTeX RDF	post dominator trees, program slicing, trees (mathematics), test suite reduction, structural properties, construction algorithm, code optimisation