X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (53) 53
Book / eBook (19) 19
Book Review (5) 5
Publication (5) 5
Book Chapter (3) 3
Newspaper Article (1) 1
Reference (1) 1
Web Resource (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
index medicus (16) 16
animals (10) 10
computer science (10) 10
algorithms (8) 8
male (8) 8
mathematics (7) 7
mathematics, applied (7) 7
history (5) 5
humans (5) 5
aged (4) 4
computer science, theory & methods (4) 4
cricetinae (4) 4
electronic books (4) 4
female (4) 4
life sciences (4) 4
research (4) 4
biography (3) 3
circadian rhythm (3) 3
computational geometry (3) 3
computational mathematics (3) 3
computational theory and mathematics (3) 3
computer science - computational geometry (3) 3
computer science applications (3) 3
control and optimization (3) 3
data structures (3) 3
general (3) 3
geometry and topology (3) 3
microbial polysaccharides (3) 3
neurosciences (3) 3
polysaccharides (3) 3
st. lawrence river (3) 3
suprachiasmatic nucleus (3) 3
united states (3) 3
zoology (3) 3
3 dimensions (2) 2
age factors (2) 2
aging (2) 2
analysis (2) 2
aufsatzsammlung (2) 2
authors (2) 2
bacteria (2) 2
biochemistry & molecular biology (2) 2
biotechnology (2) 2
canada (2) 2
castration (2) 2
cholera toxin (2) 2
circadian rhythm - physiology (2) 2
civil work history (2) 2
collision resolution (2) 2
computer algorithms (2) 2
computer science - discrete mathematics (2) 2
disease (2) 2
diseases (2) 2
ecosystem reaction (2) 2
english literature (2) 2
entrainment (2) 2
environmental sciences (2) 2
estradiol - pharmacology (2) 2
etiology (2) 2
expected length (2) 2
flow discharge regulation (2) 2
fluorescence (2) 2
folklorists (2) 2
fucose (2) 2
fungi (2) 2
geniculohypothalamic tract (2) 2
golden-hamster (2) 2
hamster (2) 2
hashing (2) 2
heavy-metals (2) 2
horseradish peroxidase (2) 2
hydrology (2) 2
impact of civil works (2) 2
in old age (2) 2
insomnia (2) 2
lake saint-francois (2) 2
lake saint-françois (2) 2
linear-time (2) 2
literary criticism (2) 2
longest probe sequence (2) 2
longevity (2) 2
maladies (2) 2
mathematical models (2) 2
open addressing (2) 2
optimization (2) 2
paredes, américo (2) 2
pathology (2) 2
pharmacology & pharmacy (2) 2
poetry (2) 2
points (2) 2
probabilistic analysis of algorithms (2) 2
probability (2) 2
psychiatry (2) 2
psychology (2) 2
queue layout (2) 2
rainfall (2) 2
rats (2) 2
retina - anatomy & histology (2) 2
retinohypothalamic tract (2) 2
reviews (2) 2
more...
Library Location Library Location
Library Location Library Location
X
Sort by Item Count (A-Z)
Filter by Count
Gerstein Science - Stacks (5) 5
Robarts - Stacks (4) 4
UTL at Downsview - May be requested (4) 4
UofT at Mississauga - Stacks (3) 3
UofT at Scarborough - Stacks (3) 3
Collection Dvlpm't (Acquisitions) - Vendor file (2) 2
Baycrest Hospital - Stacks (1) 1
Chemistry (A D Allen) - Stacks (1) 1
Earth Sciences (Noranda) - Closed Orders (1) 1
OISE - Franco-Ontarienne (1) 1
OISE - May be requested in 6-10 wks (1) 1
OISE - Stacks (1) 1
Online Resources - Online (1) 1
Robarts - Course Reserves (1) 1
Royal Ontario Museum - Stacks (1) 1
Victoria University E.J. Pratt - Stacks (1) 1
Victoria University Emmanuel College - Stacks (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


2013, OPEL (Open paths to enriched learning), ISBN 9781927356388, Volume 2, 322 pages
Book
2013, OPEL (Open paths to enriched learning), ISBN 9781927356388, Volume 2
Web Resource
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 11/2017, Volume 127, pp. 111 - 147
Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applications, their usefulness is limited by the fact that the... 
Layered separator | Planar graph | Topological minor | Layered treewidth | Nonrepetitive colouring | Minor | 3-dimensional grid drawing | Queue layout | Separator | Surface | NONREPETITIVE COLORINGS | THEOREM | TREEWIDTH | LAYOUTS | ALGORITHMS | MATHEMATICS | DIAMETER | DRAWINGS | QUEUE NUMBER | PRODUCTS | VERTEX COLORINGS | Computer science | Electrical engineering
Journal Article
SIAM Journal on Computing, ISSN 0097-5397, 2005, Volume 34, Issue 3, pp. 553 - 579
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are... 
COLORINGS | three-dimensional graph drawing | MATHEMATICS, APPLIED | tree-width | DIRECTED ACYCLIC GRAPHS | HOMOMORPHISMS | QUEUE LAYOUTS | k-tree | ALGORITHMS | 3 DIMENSIONS | queue layout | K-TREES | STACK | tree-partition | acyclic coloring | EVERY PLANAR GRAPH | PARTITIONS | COMPUTER SCIENCE, THEORY & METHODS | track-number | queue-number | tree-partition-width | track layout | acyclic chromatic number
Journal Article
Information Processing Letters, ISSN 0020-0190, 2003, Volume 86, Issue 4, pp. 215 - 219
Journal Article
Computational Geometry: Theory and Applications, ISSN 0925-7721, 2012, Volume 45, Issue 4, pp. 178 - 185
A routing algorithm is one in which the decision about the next edge on the route to a vertex for a packet currently located at vertex is made based only on... 
Geometric routing | Lower bounds | Routing | MATHEMATICS | MATHEMATICS, APPLIED | Computer science | Algorithms | Computational geometry | Subdivisions | Messages | Random walk | Mathematical models | Optimization | Computer Science - Computational Geometry
Journal Article
Computer Vision and Image Understanding, ISSN 1077-3142, 2009, Volume 113, Issue 10, pp. 1027 - 1038
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2004, Volume 321, Issue 1, pp. 25 - 40
A space-efficient algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the... 
Computational geometry | Convex hulls | In-place | in situ | In situ | in-place | LINEAR-TIME | computational geometry | convex hulls | SORTING INSITU | COMPUTER SCIENCE, THEORY & METHODS | 3 DIMENSIONS | POINTS
Journal Article
Computational Geometry: Theory and Applications, ISSN 0925-7721, 2003, Volume 24, Issue 3, pp. 135 - 146
We describe two data structures that preprocess a set S of n points in R(d) (d constant) so that the sum of Euclidean distances of points in S to a query point... 
Quadtree | Facility location | Fermat–Weber center | Randomization | Range tree | Clustering | Data structure | Fermat-Weber center | MATHEMATICS | MATHEMATICS, APPLIED | randomization | data structure | range tree | clustering | quadtree | facility location
Journal Article
Computational Geometry: Theory and Applications, ISSN 0925-7721, 2007, Volume 37, Issue 3, pp. 209 - 227
We develop a number of space-efficient tools including an approach to simulate divide-and-conquer space-efficiently, stably selecting and unselecting a subset... 
In situ algorithms | Space-efficient algorithms | In-place algorithms | LINEAR-TIME | MATHEMATICS | in situ algorithms | MATHEMATICS, APPLIED | in-place algorithms | CONVEX-HULL | space-efficient algorithms | MINIMUM SPACE | Computer science | Algorithms
Journal Article
SIAM Journal on Computing, ISSN 0097-5397, 05/2004, Volume 33, Issue 4, pp. 923 - 936
We consider open addressing hashing and implement it by using the Robin Hood strategy; that is, in case of collision, the element that has traveled the... 
Hashing | Worst-case search time | Collision resolution | Robin Hood | Open addressing | Probabilistic analysis of algorithms | worst-case search time | MATHEMATICS, APPLIED | LONGEST PROBE SEQUENCE | open addressing | hashing | TIME | COMPUTER SCIENCE, THEORY & METHODS | EXPECTED LENGTH | collision resolution | probabilistic analysis of algorithms
Journal Article
Computational Geometry: Theory and Applications, ISSN 0925-7721, 2008, Volume 39, Issue 1, pp. 2 - 13
Zonoid depth is a definition of data depth proposed by Dyckerhoff et al. [R. Dyckerhoff, G. Koshevoy, K. Mosler, Zonoid data depth: Theory and computation, in:... 
Statistical data depth | Zonotopes | Zonoids | zonotopes | MATHEMATICS | MATHEMATICS, APPLIED | zonoids | statistical data depth | PLANAR SET | OPTIMIZATION | POINTS | LINES | Computer science | Algorithms
Journal Article
Progress in Polymer Science, ISSN 0079-6700, 02/2013, Volume 38, Issue 2, pp. 344 - 368
Chemical cross-linking using epichlorohydrin as cross-linking agent is the most straightforward method to produce water-insoluble β-cyclodextrin-based... 
Polymeric network | Epichlorohydrin | Cross-linking reaction | Cyclodextrin | Environmental applications | Pollutants | DYE REMOVAL | POLYMER SCIENCE | HEAVY-METALS | INCLUSION CHROMATOGRAPHY | ADSORPTION PROPERTIES | AROMATIC-COMPOUNDS | AQUEOUS-SOLUTION | LOW-COST ADSORBENTS | WASTE-WATER | BITTER COMPONENTS | SOLID-PHASE EXTRACTION | Polymers | Chemical Sciences
Journal Article
Discrete & Computational Geometry, ISSN 0179-5376, 4/2005, Volume 33, Issue 4, pp. 593 - 604
Given a set R of red points and a set B of blue points, the nearest-neighbour decision rule classifies a new point q as red (respectively, blue) if the closest... 
Decision Rule | Computational Mathematics and Numerical Analysis | Computational Mathematic | Blue Point | Mathematics | Combinatorics | Close Point | Decision Boundary | MATHEMATICS | CONVEX-HULL ALGORITHM | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Information science | Algorithms | Geometry
Journal Article
Discrete Mathematics and Theoretical Computer Science, ISSN 1462-7264, 2009, Volume 11, Issue 1, pp. 45 - 54
The Centerpoint Theorem states that, for any set S of n points in R-d, there exists a point p in R-d such that every closed halfspace containing p contains at... 
Wedges | Halfspace depth | Centerpoint | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS | wedges | MATHEMATICS, APPLIED | Computer Science | Discrete Mathematics
Journal Article