... that the system detects subgroups with promising accu- racy. The average clustering purity of the detected subgroups in the dataset is 0.65. The system signif- icantly outperforms baseline systems ... and is freely available for download. An online demo of the system is available at: http://clair.eecs.umich.edu/SubgroupDetector/ 1 Introduction Online forums discussing ideolo...
Ngày tải lên: 16/03/2014, 20:20
... considered in this study. In Section 3, we introduce the approaches to analyze video 3 Resource reservation for mobile hotspots in vehicular envi- ronments with cellular/WLAN interworking Wei Song Faculty ... made available soon. Resource reservation for mobile hotspots in vehicular environments with cellular/WLAN interworking EURASIP Journal on Wire...
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: " Sharp bounds for Seiffert mean in terms of root mean square" pot
... that f(t) is strictly increasing in [1, +∞). 9 Sharp bounds for Seiffert mean in terms of root mean square Yu-Ming Chu ∗1 , Shou-Wei Hou 2 and Zhong-Hua Shen 2 1∗ Department of Mathematics, Huzhou ... below). For information about publishing your research in Journal of Inequalities and Applications go to http://www.journalofinequalitiesandapplications.com/authors/i...
Ngày tải lên: 20/06/2014, 21:20
Báo cáo hóa học: " CONTINUATION THEORY FOR GENERAL CONTRACTIONS IN GAUGE SPACES" ppt
... for generalized contractions, Fixed Point Theory 4 (2003), no. 1, 33–48. CONTINUATION THEORY FOR GENERAL CONTRACTIONS IN GAUGE SPACES ADELA CHISá AND RADU PRECUP Received 9 March 2004 and in ... 267–281. [24] , The continuation principle for generalized contractions, Bull. Appl. Comput. Math. (Bu- dapest) 1927 (2001), 367–373. [25] , Continuation results for map...
Ngày tải lên: 23/06/2014, 00:20
Báo cáo toán học: "Compact perturbations of definitizable operators " docx
... class="bi x0 y1 w2 h 2" alt =""
Ngày tải lên: 05/08/2014, 09:46
Báo cáo toán học: "Invariant subspaces for subquasiscalar operators " pot
...
Ngày tải lên: 05/08/2014, 09:46
Báo cáo toán học: "K-theory for certain C*-algebras. II " potx
... class="bi x0 y0 w1 h 1" alt =""
Ngày tải lên: 05/08/2014, 10:20
Báo cáo toán học: "K-theory for actions of the circle group on C*-algebras " pot
... class="bi x1 y0 w4 h 1" alt =""
Ngày tải lên: 05/08/2014, 10:20
Báo cáo toán học: "Compact perturbations of definitizable operators. II " pot
... class="bi x0 y0 w4 h 2" alt =""
Ngày tải lên: 05/08/2014, 15:20
Báo cáo toán học: "Perturbation theory for definitizable operators in Krein spaces " pptx
... alt =""
Ngày tải lên: 05/08/2014, 15:20
Báo cáo toán học: "A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON" pptx
... β invariant from matroids to greedoids, con- centrating especially on antimatroids. Several familiar expansions for β( G) have greedoid analogs. We give combinatorial interpretations for β( G )for simplicial ... greedoid and let {e}∈F. Then β( G) =β( G/e)+(−1) r(G)−r(G−e) β( G − e). We remark that since r(G − e)=r(G) for all non-isthmuses e in a matroid G, the formula above...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "General bounds for identifying codes in some infinite regular graphs" docx
... Lobstein: The minimum density of an identifying code in the king lattice, Discrete Mathematics, submitted. [4] I. Charon, O. Hudry, A. Lobstein: Identifying codes with small radius in some in nite regular ... Lobstein, G. Z´emor: New bounds for codes identifying vertices in graphs, Electronic Journal of Combinatorics, vol. 6(1), R19, 1999. [7] G. Cohen, I. Honkala, A....
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "Graph Theory for Metric Dimension and Diameter" docx
... cardinality is a metric basis of G, and |S| is the metric dimension of G, denoted by β(G). For positive integers β and D, let G β,D be the class of connected graphs with metric dimension β and diameter ... Extremal Graph Theory for Metric Dimension and Diameter ∗ Carmen Hernando † Departament de Matem`atica Aplicada I Universitat Polit`ecnica de Catalunya Barcelona...
Ngày tải lên: 08/08/2014, 12:22
Báo cáo toán học: "Random Procedures for Dominating Sets in Graphs" doc
... (6). For the converse, let D be a minimum dominating set. Note that for every vertex v i ∈ V we have N G [v i ]∩D = ∅, since D is dominating and N G [v i ]∩D = N G [v i ], since D is minimum. Therefore, ... choices for the p i ’s 3 Optimizing the Results of Random Procedures Many random procedures constructing dominating sets essentially yield a bound on the domination num...
Ngày tải lên: 08/08/2014, 12:22
Báo cáo toán học: "Lower bounds for identifying codes in some infinite grids" potx
... electronic journal of combinatorics 17 (2010), #R122 6 References [1] Ir`ene Charon, Iiro Honkala, Olivier Hudry, and Antoine Lobstein. General bounds for identifying codes in some in nite regular graphs. ... of density in certain in nite graphs which are locally finite. We present new lower bounds for densities of codes for some sm all values of r in both the squa...
Ngày tải lên: 08/08/2014, 12:22