The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 3594 of Mathematical Reviews Vol. , Issue 92g
[page]
1992
Mathematical Reviews
Preserved Fulltext
This gives an O(n3/* logn) algorithm for the Chinese postman problem in planar graphs, and hence also for solving the max-cut problem in planar graphs. ...
time for dense graphs and O(mlogn) for sparse graphs. ...
An approach for parcellating human cortical areas using resting-state correlations
2014
NeuroImage
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
RSFC-based parcellation converges with parcellation information from other modalities in many locations, including taskevoked activity and probabilistic estimates of cellular architecture, providing evidence for ...
We not only highlight a collection of these observations, but also point out several limitations and observations that mandate careful consideration in using and interpreting RSFC for the purposes of parcellating ...
We also thank Malcolm Tobias, Avi Snyder, Matt Glasser, and Babatunde Adeyemo for technical support and assistance. ...
doi:10.1016/j.neuroimage.2013.07.035
pmid:23876247
pmcid:PMC3912214
fatcat:vsozqdoiv5dnpa3idmk6fzwaae
Finding communities in linear time: a physics approach
2004
European Physical Journal B : Condensed Matter Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We present a method that allows for the discovery of communities within graphs of arbitrary size in times that scale linearly with their size. ...
We additionally show how this algorithm allows for the swift discovery of the community surrounding a given node without having to extract all the communities out of a graph. ...
The idea is to randomly pick two poles, apply the algorithm to divide the graph into two communities, and repeat it for many times (the total time is still O(V + E)). ...
doi:10.1140/epjb/e2004-00125-x
fatcat:a3dqwyc7evfp3m6cudpn6wtv6m
An Ontology-Based Framework for Complex Urban Object Recognition through Integrating Visual Features and Interpretable Semantics
2020
Complexity
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This work is conducive to the development of complex urban object recognition toward the fields including multilayer learning algorithms and knowledge graph-based relational reinforcement learning. ...
Secondly, we exploit semantic web rule language to propose an encoder model for decomposing the RDF-triple rules based on a multilayer strategy. ...
Acknowledgments is research was supported by "the Fundamental Research Funds for the Central Universities (Grant no. 2020QN28)." ...
doi:10.1155/2020/5125891
fatcat:ao5o6jxog5f53ge2lilybpgisu
Rapid bushy join-order optimization with Cartesian products
1996
SIGMOD record
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
We start by presenting a Cartesian product optimizer that requires at most a few seconds of workstation time to search the space of bushy plans for products of up to 15 relations. ...
Query optimizers often limit the search space for join orderings, for example by excluding Cartesian products in subplans or by restricting plan trees to left-deep vines. ...
The array of graphs in Figure 4 presents HP 9000/755 timings taken over a 4-dimensional space with n = 15. ...
doi:10.1145/235968.233317
fatcat:q5p77q5eajaghpq3ovkmfti2gq
Rapid bushy join-order optimization with Cartesian products
1996
Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
We start by presenting a Cartesian product optimizer that requires at most a few seconds of workstation time to search the space of bushy plans for products of up to 15 relations. ...
Query optimizers often limit the search space for join orderings, for example by excluding Cartesian products in subplans or by restricting plan trees to left-deep vines. ...
The array of graphs in Figure 4 presents HP 9000/755 timings taken over a 4-dimensional space with n = 15. ...
doi:10.1145/233269.233317
dblp:conf/sigmod/VanceM96
fatcat:urpaeczirrahdpkhahbtip7exy
Human Recognition Based On Ear Shape Images Using PCA-Wavelets and Different Classification Methods
2016
Medical Devices and Diagnostic Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
for recognition. ...
Recently, Islam [11] had proposed using AdaBoost algorithm to extract ear images. ...
Their technique used an adjacency graph built from Voroni regions of earcurve segments. ...
doi:10.15761/mdde.1000103
fatcat:i4mvevfxtzagrorlpvqbdx63te
A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers
2014
International Journal for Numerical Methods in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The Schur complement constructed from the suspicious null pivots is examined by a factorization with 1×1 and 2×2 pivoting and by a robust kernel detection algorithm based on measurement of residuals with ...
and to have an ability of kernel detection. ...
ACKNOWLEDGMENT The authors thank Xavier Juvigny for writing routines to call graph partitioning libraries. ...
doi:10.1002/nme.4729
fatcat:y2e4lcveqjbljiidszzeoysrya
Multi-way Graph Signal Processing on Tensors: Integrative analysis of irregular geometries
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Graph signal processing (GSP) is an important methodology for studying data residing on irregular structures. ...
In this paper, we review modern signal processing frameworks generalizing GSP to multi-way data, starting from graph signals coupled to familiar regular axes such as time in sensor networks, and then extending ...
For example, the tubular fiber Xij: is an n3 dimensional time-series of the i, jth pixel across all frames; the two tubular fibers correspond to the highlighted pixels in the tensor. ...
arXiv:2007.00041v2
fatcat:i2e77o5njrhkpfoxtdswdkpibm
Topology matching for fully automatic similarity estimation of 3D shapes
2001
Proceedings of the 28th annual conference on Computer graphics and interactive techniques - SIGGRAPH '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Topology Matching is particularly useful for interactively searching for a 3D object because the results of the search fit human intuition well. ...
This paper proposes a novel technique, called Topology Matching, in which similarity between polyhedral models is quickly, accurately, and automatically calculated by comparing Multiresolutional Reeb Graphs ...
., Ltd. for continuously supporting our work. Thanks are extended to the members of Shinagawa Laboratory for suggestions and discussions. ...
doi:10.1145/383259.383282
dblp:conf/siggraph/HilagaSKK01
fatcat:nrzupyisuzd5xi5ctupc5u5ci4
Real-time vision-based robot localization
1993
IEEE Transactions on Robotics and Automation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this article we describe an algorithm for robot localization using visual landmarks. ...
Comments Abstract In this article we describe an algorithm for robot localization using visual landmarks. ...
We wish to thank Jerome Kodjabachian and Max Mintz for their careful reading of earlier drafts of this paper, and Jerome Kodjabachian for the closed-form solution to the angle maximization problem. ...
doi:10.1109/70.265922
fatcat:r2gtnmvitbd6llp3kuckbx7m74
Agent interface enhancement
2006
Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems - AAMAS '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
3 2 3 3 3 2 4 m3 2 3 3 2 3 3 3 2 m4 2 3 3 3 3 4 5 Table 1 shows values for k1, · · · , k8 given dimensions n1, · · · , n3, m1, · · · , m4. ...
m2 * n2, k7 = m2 * m3 * n1 + m2 * n2 + m3 * n3, k8 = m1 * m3 * n2 + m1 * n1 + m3 * n3 2 3 3 3 5 5 7 7 n2 2 3 3 3 5 6 6 4 n3 2 3 3 3 5 5 5 5 m1 2 2 3 3 2 2 4 3 m2 2 ...
doi:10.1145/1160633.1160635
dblp:conf/atal/XiangZ06
fatcat:eztr7sts5vb2hauropv4qwvcj4
RiAiR: A Framework for Sensitive RDFProtection
2019
Journal of Web Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
An intersection process suggests disclosure sources that can compromise the data. ...
Results show a viability and high performance for a scenario where heterogeneous and linked datasets are present. ...
Reducing-Complexity process for Data 2 with a step 0.01 Data 2
Input
Output
Threshold
Triples
Jena Time
(ms)
Size
(bytes) Triples
Jena Time
(ms)
Size
(bytes)
[1.00 , 0.50]
10,000
69.25 ...
doi:10.13052/jwe1540-9589.18132
fatcat:46febueqvjhgfjuwlfmtbgzkii
Approximate Group Fairness for Clustering
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
algorithms accordingly. ...
Particularly, we propose two dimensions to relax core requirements: one is on the degree of distance improvement, and the other is on the size of deviating coalition. ...
For any metric space with n 2 ≤ k ≤ n − 2, there is an algorithm that computes a (1, 2)-core clustering in O(n 2 log n) time. i∈S d(i, Y ) i∈S d(i, y ) ≤ 1 + i∈S d(y * , y ) i∈S d(i, y ) ≤ 1 + i∈S d(y ...
arXiv:2203.17146v1
fatcat:kfxdqstpcbck7dd53dwfmwcgie
The Network Structure of Human Personality According to the NEO-PI-R: Matching Network Community Structure to Factor Structure
2012
PLoS ONE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Human personality is described preferentially in terms of factors (dimensions) found using factor analysis. ...
An alternative and highly related method is network analysis, which may have several advantages over factor analytic methods. ...
Acknowledgments We would like to thank the management team of the Outpatient Clinic of the Department of Mood disorders, PsyQ, for providing the required amount of research time. ...
doi:10.1371/journal.pone.0051558
pmid:23284713
pmcid:PMC3527484
fatcat:6opl23bma5hvvnkxf2phvpb6tm
« Previous
Showing results 1 — 15 out of 812 results