"Partitioning arrangements of lines: I. An efficient deterministic algorithm."

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Partitioning arrangements of lines: I. An efficient deterministic algorithm.	Pankaj K. Agarwal	1989	Courant Institute of Mathematical Sciences, New York University
Partitioning arrangements of lines: II. Applications.	Pankaj K. Agarwal	1989	Courant Institute of Mathematical Sciences, New York University
An efficient parallel biconnectivity algorithm	Robert E. Tarjan	1983	Courant Institute of Mathematical Sciences, New York University
An efficient parallel biconnectivity algorithm	Robert E. Tarjan	1983	Courant Institute of Mathematical Sciences, New York University
The generation of a deterministic parsing algorithm.	Alan James Beals	1969
Efficient implementation of a shifting algorithm	Yehoshua Perl	1983	Courant Institute of Mathematical Sciences, New York University
SEMIALGEBRAIC PROOFS AND EFFICIENT ALGORITHM DESIGN;	NOAH FLEMING; PRAVESH KOTHARI; TONIANN PITASSI.	2019	NOW PUBLISHERS
Energy Efficient Node Placement Using Genetic Algorithm		15/01/2014	Association of Scientists, Developers and Faculties
An efficient algorithm for finding connected components in a binary image.	Jacob T. Schwartz	1985	Courant Institute of Mathematical Sciences, New York University
An efficient algorithm for finding connected components in a binary image	Jacob T. Schwartz	1985	Courant Institute of Mathematical Sciences, New York University
Implicitly representing arrangements of lines or segments	Herbert Edelsbrunner	1988	Courant Institute of Mathematical Sciences, New York University
Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm	Calvin Marion Anderson	1973	Naval Postgraduate School
Deterministic chaos: an introduction /	Schuster, Heinz Georg,	[1995], ©1995.	VCH,
Deterministic chaos: an introduction	Heinz Georg Schuster	1988	VCH;Distribution, USA and Canada, VCH
Knowledge acquisition through conceptual clustering: a theoretical framework and an algorithm for partitioning data into conjunctive concepts	Ryszard Stanisaw Michalski	1980	Dept. of Computer Science, University of Illinois at Urbana-Champaign
An efficient string matching algorithm with k differences for nucleotide and amino acid sequences	Gad M. Landau	1985	Courant Institute of Mathematical Sciences, New York University
An efficient string matching algorithm with k differences for nucleotide and amino acid sequences.	Gad M. Landau	1985	Courant Institute of Mathematical Sciences, New York University
Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software	Rudolf Fleischer; Bernhard Moret; Erik Meineche Schmidt	2002	Springer Berlin Heidelberg
Task partitioning: an innovation process variable	Eric von Hippel	1988	Sloan School of Management, Massachusetts Institute of Technology
Task partitioning: an innovation process variable	Eric von Hippel	1989	Alfred P. Sloan School of Management, Massachusetts Institute of Technology
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
Design and Implementation of an Efficient Thread Partitioning Algorithm	José Nelson Amaral; Guang Gao; Erturk Dogan Kocalar; Patrick O’Neill; Xinan Tang	High Performance Computing: Third International Symposium, ISHPC 2000 Tokyo, Japan, October 16-18, 2000 Proceedings	Mateo Valero; Kazuki Joe; Masaru Kitsuregawa; Hidehiko Tanaka	2000	Springer Berlin Heidelberg
RLDRPSO: An Efficient Heuristic Algorithm for Task Partitioning	Xiaofeng Qi; Xingming Zhang; Kaijian Yuan	Advanced Computer Architecture: 11th Conference, ACA 2016, Weihai, China, August 22-23, 2016, Proceedings	Junjie Wu; Lian Li	1st ed. 2016	Springer Nature Singapore
An Efficient Parallel Joint Algorithm Based on Hypercube-Partitioning	H. I. Choi, B. M. Im, M. H. Kim and Y.-J. Lee	Proceedings of the Third International Conference on Parallel and Distributed Information Systems: September 28-30, 1994, Austin, Texas /	Association for Computing Machinery.	[1994], ©1994.	IEEE Computer Society Press,
Deterministic Algorithm		Sparse Adaptive Filters for Echo Cancellation	Jacob Benesty, Constantin Paleologu, Silviu Ciochina	2010	Morgan and Claypool Publishers
Deterministic Parallel Hypergraph Partitioning	Lars Gottesbüren; Michael Hamann	Euro-Par 2022: Parallel Processing: 28th International Conference on Parallel and Distributed Computing, Glasgow, UK, August 22–26, 2022, Proceedings	José Cano; Phil Trinder	1st ed. 2022	Springer International Publishing
ARRANGEMENTS OF STRAIGHT LINES		Handbook of discrete and computational geometry	Goodman J.E., O'Rourke J. (eds.)	2004	CRC
Arrangements Of Straight Lines		Handbook of discrete and computational geometry, Second Edition	Jacob E. Goodman, Joseph O'Rourke	2004	Chapman & Hall/CRC
Efficient array partitioning	Sanjeev Khanna; S. Muthukrishnan; Steven Skiena	Automata, Languages and Programming: 24th International Colloquium, ICALP' 97, Bologna, Italy, July 7 - 11, 1997, Proceedings	Pierpaolo Degano; Roberto Gorrieri; Alberto Marchetti-Spaccamela	1997	Springer Berlin Heidelberg
An efficient implementation of the spectral partitioning algorithm on connection machine systems	Zdenek Johan; Thomas J. R. Hughes	Future Tendencies in Computer Science, Control and Applied Mathematics: International Conference on the Occasion of the 25th Anniversary of INRIA, Paris, France, December 8-11, 1992. Proceedings	Alain Bensoussan; Jean-Pierre Verjus	1992	Springer Berlin Heidelberg
Efficient Random Arrangements		Combinatorial Geometry	János Pach	1995	John Wiley & Sons
An Efficient Space-Partitioning Based Algorithm for the K-Means Clustering	Khaled AlSabti; Sanjay Ranka; Vineet Singh	Methodologies for Knowledge Discovery and Data Mining: Third Pacific-Asia Conference, PAKDD' 99, Beijing, China, April 26-28, 1999, Proceedings	Ning Zhong; Lizhu Zhou	1999	Springer Berlin Heidelberg
1062 Deterministic algorithm		Foundations of Machine Learning	Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar	2018	MIT Press
A Deterministic Algorithm		Combinatorial Optimization and Applications	A. Dress, et al.	2007	Springer
1062 Deterministic algorithm		Foundations of Machine Learning	Mohri Mehryar, Afshin Rostamizadeh, and Ameet Talwalkar	2018	The MIT Press
772 Partitioning Algorithm		Data Science with R A Step By Step Guide With Visual Illustrations and Examples	Andrew Oleksy	2018	Andrew Oleksy
An Efficient Attribute Reduction Algorithm	Yuguo He	Intelligent Data Engineering and Automated Learning - IDEAL 2006: 7th International Conference, Burgos, Spain, September 20-23, 2006, Proceedings	Emilio Corchado; Hujun Yin; Vicente Botti; Colin Fyfe	2006	Springer Berlin Heidelberg
An Efficient Pre-determinization Algorithm	Cyril Allauzen; Mehryar Mohri	Implementation and Application of Automata: 8th International Conference, CIAA 2003, Santa Barbara, CA, USA, July 16-18, 2003. Proceedings	Oscar H. Ibarra; Zhe Dang	2003	Springer Berlin Heidelberg
An Efficient Schema Matching Algorithm	Wei Cheng; Heshui Lin; Yufang Sun	Knowledge-Based Intelligent Information and Engineering Systems: 9th International Conference, KES 2005, Melbourne, Australia, September 14-16, 2005, Proceedings, Part II	Rajiv Khosla	2005	Springer Berlin Heidelberg
An Efficient Knowledge Clustering Algorithm	Wei Emma Zhang; Quan Z. Sheng	Managing Data From Knowledge Bases: Querying and Extraction	Wei Emma Zhang; Quan Z. Sheng	1st ed. 2018	Springer International Publishing
Efficient Algorithm		Encyclopedia of Operations Research and Management Science	Saul I. Gass; Michael C. Fu	3rd ed. 2013	Springer US
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Partitioning arrangements of lines: I. An efficient deterministic algorithm." - similar Books and Chapters