Search

Your search keyword '"Edge density"' showing total 433 results
Start Over Descriptor "Edge density"
433 results on '"Edge density"'

52. A Clustering Coefficient Network Formation Game

Author

Brautbar, Michael, Kearns, Michael, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Persiano, Giuseppe, editor

Published
2011
Full Text
View/download PDF

53. Prediction of post-stroke cognitive impairment based on lesion location

Author

Kaminski, Jamie, Boes, Aaron, Tranel, Daniel, and Bowren, Mark

Subjects
Behavioral Neurobiology, Neuroscience and Neurobiology, edge density, Cognitive Neuroscience, arcuate fasciculus, Life Sciences, lesion behavior map, stroke, structural disconnection
Abstract

Recent work in our lab has shown that acquired brain lesions in specific regions are associated with impaired general cognitive ability (g). Evidence for this was from regional findings identified in a multivariate lesion symptom mapping analysis of 402 individuals of general cognitive ability (Bowren, 2020). A second independent analysis showed that white matter regions with a high density of structural connections was similarly associated with cognitive impairment (Reber, 2021). In this study we test the hypothesis that lesions that intersect with these two maps are associated with greater cognitive impairment relative to lesions that spare these regions, which we will test in an independent sample of individuals with stroke.

Published
2022
Full Text
View/download PDF

54. Reweighted Random Walks for Graph Matching

Author

Cho, Minsu, Lee, Jungmin, Lee, Kyoung Mu, Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Daniilidis, Kostas, editor, Maragos, Petros, editor, and Paragios, Nikos, editor

Published
2010
Full Text
View/download PDF

55. Tight Thresholds for Cuckoo Hashing via XORSAT : (Extended Abstract)

Author

Dietzfelbinger, Martin, Goerdt, Andreas, Mitzenmacher, Michael, Montanari, Andrea, Pagh, Rasmus, Rink, Michael, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Abramsky, Samson, editor, Gavoille, Cyril, editor, Kirchner, Claude, editor, Meyer auf der Heide, Friedhelm, editor, and Spirakis, Paul G., editor

Published
2010
Full Text
View/download PDF

56. Separation dimension and sparsity.

Author

Alon, Noga, Basavaraju, Manu, Chandran, L. Sunil, Mathew, Rogers, and Rajendraprasad, Deepak

Subjects
*SEPARATION (Technology), *DIMENSIONS, *HYPERPLANES, *MONOTONE operators, *GRAPH theory
Abstract

Abstract: The separation dimension π ( G ) of a hypergraph G is the smallest natural number k for which the vertices of G can be embedded in R k so that any pair of disjoint edges in G can be separated by a hyperplane normal to one of the axes. Equivalently, it is the cardinality of a smallest family F of total orders of V ( G ), such that for any two disjoint edges of G, there exists at least one total order in F in which all the vertices in one edge precede those in the other. Separation dimension is a monotone parameter; adding more edges cannot reduce the separation dimension of a hypergraph. In this article, we discuss the influence of separation dimension and edge‐density of a graph on one another. On one hand, we show that the maximum separation dimension of a k‐degenerate graph on n vertices is O ( k lg lg n ) and that there exists a family of 2‐degenerate graphs with separation dimension Ω ( lg lg n ). On the other hand, we show that graphs with bounded separation dimension cannot be very dense. Quantitatively, we prove that n‐vertex graphs with separation dimension s have at most 3 ( 4 lg n ) s − 2 · n edges. We do not believe that this bound is optimal and give a question and a remark on the optimal bound. [ABSTRACT FROM AUTHOR]

Published
2018
Full Text
View/download PDF

57. 1-Fan-bundle-planar drawings of graphs.

Author

Angelini, Patrizio, Bekos, Michael A., Kaufmann, Michael, Kindermann, Philipp, and Schneck, Thomas

Subjects
*PLANAR graphs, *BIPARTITE graphs, *GEOMETRIC vertices, *PATHS & cycles in graph theory, *EDGES (Geometry)
Abstract

Edge bundling is an important concept, heavily used for graph visualization purposes. To enable the comparison with other established nearly-planarity models in graph drawing, we formulate a new edge-bundling model which is inspired by the recently introduced fan-planar graphs. In particular, we restrict the bundling to the end segments of the edges. Similarly to 1-planarity, we call our model 1-fan-bundle-planarity , as we allow at most one crossing per bundle. For the two variants where we allow either one or, more naturally, both end segments of each edge to be part of bundles, we present edge density results and consider various recognition questions, not only for general graphs, but also for the outer and 2-layer variants. We conclude with a series of challenging questions. [ABSTRACT FROM AUTHOR]

Published
2018
Full Text
View/download PDF

58. Improvements on the density of maximal 1‐planar graphs.

Author

Barát, János and Tóth, Géza

Subjects
*PLANAR graphs, *PATHS & cycles in graph theory, *MATHEMATICAL bounds, *MAXIMA & minima, *GRAPH theory
Abstract

Abstract: A graph is 1‐planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1‐planar drawing is called 1‐plane. A graph is maximal 1‐planar (1‐plane), if we cannot add any missing edge so that the resulting graph is still 1‐planar (1‐plane). Brandenburg et al. showed that there are maximal 1‐planar graphs with only 45 17 n + O ( 1 ) ≈ 2.647 n edges and maximal 1‐plane graphs with only 7 3 n + O ( 1 ) ≈ 2.33 n edges. On the other hand, they showed that a maximal 1‐planar graph has at least 28 13 n − O ( 1 ) ≈ 2.15 n − O ( 1 ) edges, and a maximal 1‐plane graph has at least 2.1 n − O ( 1 ) edges. We improve both lower bounds to 20 n 9 ≈ 2.22 n. [ABSTRACT FROM AUTHOR]

Published
2018
Full Text
View/download PDF

59. Influence of breeding habitat characteristics and landscape heterogeneity on anuran species richness and abundance in urban parks of Shanghai, China.

Author

Li, Ben, Zhang, Wei, Shu, Xiaoxiao, Pei, Enle, Yuan, Xiao, Wang, Tianhou, and Wang, Zhenghuan

Subjects
URBANIZATION, SPECIES diversity, URBAN parks, SPECIES-area relationships, PELOPHYLAX
Abstract

Urbanization has caused a significant decline in amphibians worldwide due to habitat loss, fragmentation, and degradation of habitat quality. Accordingly, parks have become “islands,” or habitat fragments, for amphibians in highly urbanized areas. Understanding the habitat use pattern of amphibians in fragmented urban environments is essential for biodiversity conservation in urban ecosystems. Several environmental features may affect anuran communities in urban parks, including the characteristics of fragmentation, landscape heterogeneity, breeding habitat, and human disturbance. In particular, it is unclear whether a larger habitat area could lead to higher anuran species richness (species-area relationship) in urban parks. The aim of this study was to examine whether the species-area relationship is relevant for anurans in urban parks, and to determine the environmental characteristics that likely influence anuran communities. We used a visual encounter method to survey anuran communities (species richness and abundance) in 16 parks located in highly urbanized areas of Shanghai, China. Fragmentation characteristics included fragment size and shape index. Landscape heterogeneity was measured as compositional heterogeneity (using the Shannon diversity index of wetland types) and configurational heterogeneity (using edge density of different land use types). We found that compositional and configurational heterogeneity had significant positive effects on anuran species richness and relative abundance, respectively, in the urban parks. We also found that high edge density along streams benefited anuran abundance. However, there was no significant relationship between fragment size and anuran communities, and the abundances of Pelophylax plancyi and P. nigromaculata were negatively associated with the edge density of large ponds and roads. Our results suggest the importance of landscape structure in urban parks for sustaining anuran persistence. In addition, diverse breeding habitats and landscape heterogeneity should be considered positive indicators of anuran biodiversity conservation in fragmented urban habitats. [ABSTRACT FROM AUTHOR]

Published
2018
Full Text
View/download PDF

60. Fast Smoke Detection for Video Surveillance Using CUDA.

Author

Filonenko, Alexander, Hernandez, Danilo Caceres, and Jo, Kang-Hyun

Abstract

Smoke detection is a key component of disaster and accident detection. Despite the wide variety of smoke detection methods and sensors that have been proposed, none has been able to maintain a high frame rate while improving detection performance. In this paper, a smoke detection method for surveillance cameras is presented that relies on shape features of smoke regions as well as color information. The method takes advantage of the use of a stationary camera by using a background subtraction method to detect changes in the scene. The color of the smoke is used to assess the probability that pixels in the scene belong to a smoke region. Due to the variable density of the smoke, not all pixels of the actual smoke area appear in the foreground mask. These separate pixels are united by morphological operations and connected-component labeling methods. The existence of a smoke region is confirmed by analyzing the roughness of its boundary. The final step of the algorithm is to check the density of edge pixels within a region. Comparison of objects in the current and previous frames is conducted to distinguish fluid smoke regions from rigid moving objects. Some parts of the algorithm were boosted by means of parallel processing using compute unified device architecture graphics processing unit, thereby enabling fast processing of both low-resolution and high-definition videos. The algorithm was tested on multiple video sequences and demonstrated appropriate processing time for a realistic range of frame sizes. [ABSTRACT FROM PUBLISHER]

Published
2018
Full Text
View/download PDF

62. Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem

Author

Fleischer, Rudolf, Wu, Xi, Yuan, Liwei, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Fiat, Amos, editor, and Sanders, Peter, editor

Published
2009
Full Text
View/download PDF

63. Drawing Graphs with Right Angle Crossings : (Extended Abstract)

Author

Didimo, Walter, Eades, Peter, Liotta, Giuseppe, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Dehne, Frank, editor, Gavrilova, Marina, editor, Sack, Jörg-Rüdiger, editor, and Tóth, Csaba D., editor

Published
2009
Full Text
View/download PDF

64. Kernelization of Softassign and Motzkin-Strauss Algorithms

Author

Lozano, M. A., Escolano, F., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Cabestany, Joan, editor, Sandoval, Francisco, editor, Prieto, Alberto, editor, and Corchado, Juan M., editor

Published
2009
Full Text
View/download PDF

65. Detection of Locally Over-Represented GO Terms in Protein-Protein Interaction Networks

Author

Lavallée-Adam, Mathieu, Coulombe, Benoit, Blanchette, Mathieu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Istrail, Sorin, editor, Pevzner, Pavel, editor, Waterman, Michael S., editor, and Batzoglou, Serafim, editor

Published
2009
Full Text
View/download PDF

68. A Vector Assignment Approach for the Graph Coloring Problem

Author

Ono, Takao, Yagiura, Mutsunori, Hirata, Tomio, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Maniezzo, Vittorio, editor, Battiti, Roberto, editor, and Watson, Jean-Paul, editor

Published
2008
Full Text
View/download PDF

69. Landscape genetic analysis suggests stronger effects of past than current landscape structure on genetic patterns of Primula veris

Author

Aveliina Helm, Iris Reinula, Sabrina Träger, Ignacio M. Hernández-Agramonte, and Tsipe Aavik

Subjects
geography, Primula, Genetic diversity, geography.geographical_feature_category, Landscape change, Edge density, biology, Landscape structure, Ecology, biology.organism_classification, Genetic analysis, Ecology, Evolution, Behavior and Systematics, Grassland
Published
2021

70. LP-based dual bounds for the maximum quasi-clique problem

Author

Fabrizio Rossi, Andrea Pizzuti, and Fabrizio Marinelli

Subjects
Discrete mathematics, Quasi-clique, Edge density, Applied Mathematics, Computation, 0211 other engineering and technologies, Integer reformulation, 021107 urban & regional planning, Mixed integer programming, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Clique problem, 010201 computation theory & mathematics, Exponential number, Discrete Mathematics and Combinatorics, Column generation, Undirected graph, Integer programming, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics, Linear number
Abstract

A γ -quasi-clique is a simple and undirected graph with edge density of at least γ . Given a graph G , the maximum γ -quasi-clique problem ( γ -QCP) consists of finding an induced γ -quasi-clique with the maximum number of vertices. γ -QCP generalizes the well-known maximum clique problem and its solution is useful for detecting dense subgraphs. After reviewing known integer linear programming formulations and dual bounds for γ -QCP, a new formulation obtained by decomposing star inequalities and combining edge inequalities is proposed. The model has an exponential number of variables but a linear number of constraints and its linear relaxation allows the computation by column generation of dual bounds for large and dense graphs. The connectivity of γ -quasi-cliques is also discussed and a new sufficient connectivity condition presented. An extensive computational experience shows the quality of the computed dual bounds and their performance in a branch-and-price framework, as well as the practical effectiveness of the connectivity condition.

Published
2021

71. The feasible region of hypergraphs

Author

Xizhi Liu and Dhruv Mubayi

Subjects
Sequence, Mathematics::Combinatorics, Edge density, 010102 general mathematics, Feasible region, 0102 computer and information sciences, Function (mathematics), Unit square, 01 natural sciences, Infimum and supremum, Theoretical Computer Science, Combinatorics, Computational Theory and Mathematics, 010201 computation theory & mathematics, FOS: Mathematics, Mathematics - Combinatorics, Discrete Mathematics and Combinatorics, Almost everywhere, Combinatorics (math.CO), Differentiable function, 0101 mathematics, Mathematics
Abstract

Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs. The feasible region $\Omega(\mathcal{F})$ of $\mathcal{F}$ is the set of points $(x,y)$ in the unit square such that there exists a sequence of $\mathcal{F}$-free $r$-uniform hypergraphs whose edge density approaches $x$ and whose shadow density approaches $y$. The feasible region provides a lot of combinatorial information, for example, the supremum of $y$ over all $(x,y) \in \Omega(\mathcal{F})$ is the Tur\'{a}n density $\pi(\mathcal{F})$, and $\Omega(\emptyset)$ gives the Kruskal-Katona theorem. We undertake a systematic study of $\Omega(\mathcal{F})$, and prove that $\Omega(\mathcal{F})$ is completely determined by a left-continuous almost everywhere differentiable function; and moreover, there exists an $\mathcal{F}$ for which this function is not continuous. We also extend some old related theorems. For example, we generalize a result of Fisher and Ryan to hypergraphs and extend a classical result of Bollob\'as by almost completely determining the feasible region for cancellative triple systems., Comment: Minor changes in page 2 and page 3 and Lemma 5.3

Published
2021

72. Land Use/Cover Change Reduces Elephant Habitat Suitability in the Wami Mbiki-Saadani Wildlife Corridor, Tanzania

Author

Ntukey, Lucas Theodori, Munishi, Linus Kasian, Kohi, Edward, Treydte, Anna Christina, Ntukey, Lucas Theodori, Munishi, Linus Kasian, Kohi, Edward, and Treydte, Anna Christina

Abstract

Wildlife corridors are critical for maintaining the viability of isolated wildlife populations and conserving ecosystem functionality. Anthropogenic pressure has negatively impacted wildlife habitats, particularly in corridors between protected areas, but few studies have yet quantitatively assessed habitat changes and corresponding wildlife presence. We quantified land use/land cover and human–elephant conflict trends over the past two decades in the Wami Mbiki–Saadani (WMS) wildlife corridor, Tanzania, using RS and GIS combined with human–wildlife conflict reports. We designed landscape metrics and habitat suitability models for the African savanna elephant (Loxodonta africana) as a large mammal key species in the WMS ecosystem. Our results showed that forest cover, a highly suitable habitat for elephants, decreased by 3.0% between 1998 and 2008 and 20.3% between 2008 and 2018. Overall, the highly suitable habitat for elephants decreased by 22.4% from 1998 to 2018, when it was scarcely available and when small fragmented patches dominated the unprotected parts of the corridor. Our findings revealed that large mammalian habitat conservation requires approaches beyond habitat-loss detection and must consider other facets of landscape patterns. We suggest strengthening elephant habitat conservation through community conservation awareness, wildlife corridor mapping, and restoration practices to ensure a sustainable pathway to human–wildlife coexistence.

Published
2022
Full Text
View/download PDF

73. Landscape heterogeneity impacts aphid suppression while adjacent habitats and aphid abundance impact predator movement in soybean

Author

MacKay, Pat (Entomology), Gulden, Rob (Plant Science), Costamagna, Alejandro, Almdal, Crystal, MacKay, Pat (Entomology), Gulden, Rob (Plant Science), Costamagna, Alejandro, and Almdal, Crystal

Abstract

Landscape homogenization has resulted in the loss of crop and habitat diversity in agroecosystems, creating resource bottlenecks and higher rates of chemical inputs. This negatively impacts natural enemy communities and natural pest control. Landscape heterogeneity is thought to benefit predator populations (increased landscape complementation) and lower pest colonization (decreased resource concentration); however, few studies have investigated the relative contribution of these two processes in pest suppression. Habitats provide predators with differing floral and/or prey resources. Understanding how predators move between habitats during pest outbreaks is important for assessing how we can improve pest control in agricultural landscapes. My study investigates the direct and indirect impacts of landscape heterogeneity on sentinel soybean aphid populations open to and excluded from predation, in 23 soybean fields in Manitoba in 2017 and 2018 and aims to determine the role of adjacent habitats in predator movement in soybean during an aphid outbreak. Soybean fields were adjacent to alfalfa, canola, spring wheat, or woody vegetation. Five sticky traps were placed in soybean and the adjacent habitat to quantify predator abundance in 2017. Both years, bi-directional Malaise traps were used to quantify predator movement and sweep net samples and plant counts were conducted to quantify predator and aphid abundance in soybean. We found positive effects of crop diversity (1.5 km) on aphid abundance and indirect benefits to aphid suppression in the outbreak year, and positive effects of edge density (1.5 km) on aphid suppression during the low aphid year. Syrphids and coccinellids dominated all samples, were more abundant during the outbreak year, and their immigration was in response to aphid density. Syrphid movement was more impacted by the type of adjacent habitat than coccinellid movement, and wheat and canola were the main contributors of syrphids to soybean. Coccinel

Published
2022

74. Smaller agricultural fields, more edges, and natural habitats reduce herbicide-resistant weeds

Author

Garibaldi, L.A., Goldenberg, M.G., Burian, Alfred, Santibañez, F., Satorre, E.H., Martini, G.D., Seppelt, Ralf, Garibaldi, L.A., Goldenberg, M.G., Burian, Alfred, Santibañez, F., Satorre, E.H., Martini, G.D., and Seppelt, Ralf

Abstract

The exponential growth of herbicide-resistant weeds poses enormous challenges to the sustainability of food systems. While great efforts in weed management are being performed at the plot level, the influence of the landscape context on the presence of herbicide-resistant weeds remains largely unknown. We tested these ideas through a large-scale sampling on two of the most important crops globally: maize and soybean. In Argentina, we co-developed with farmers the sampling of 2846 soybean and 1539 maize fields (covering an area of 159 million ha) and measured the presence of herbicide-resistant weeds, landscape context (field size, edge density, natural habitat size), management variables (e.g. fertilization), crop variety, farm identity and region. We found that smaller fields, with higher edge density, and neighboring larger natural habitats were associated to a lower presence of herbicide-resistant weeds. These results were not confounded with the influence of some other management variables (e.g. fertilization), crop variety, farm or region. Landscape design is an important, but underrepresented, management tool that could help to achieve a sustainable control of weeds.

Published
2022

75. Matching Graphs with Unique Node Labels

Author

Cherniavsky, John C., editor, Constable, Robert, editor, Gallier, Jean, editor, Platek, Richard, editor, Statman, Richard, editor, Bunke, Horst, Dickinson, Peter J., Kraetzl, Miro, and Wallis, Walter D.

Published
2007
Full Text
View/download PDF

76. EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms

Author

Di Gaspero, Luca, Roli, Andrea, Schaerf, Andrea, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Stützle, Thomas, editor, Birattari, Mauro, editor, and H. Hoos, Holger, editor

Published
2007
Full Text
View/download PDF

77. Szemerédi’s Regularity Lemma and Its Applications to Pairwise Clustering and Segmentation

Author

Sperotto, Anna, Pelillo, Marcello, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Yuille, Alan L., editor, Zhu, Song-Chun, editor, Cremers, Daniel, editor, and Wang, Yongtian, editor

Published
2007
Full Text
View/download PDF

78. Can a Graph Have Distinct Regular Partitions?

Author

Alon, Noga, Shapira, Asaf, Stav, Uri, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Lin, Guohui, editor

Published
2007
Full Text
View/download PDF

79. Constellations and the Unsupervised Learning of Graphs

Author

Bonev, Boyan, Escolano, Francisco, Lozano, Miguel A., Suau, Pablo, Cazorla, Miguel A., Aguilar, Wendy, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Escolano, Francisco, editor, and Vento, Mario, editor

Published
2007
Full Text
View/download PDF

80. Crossing Minimization in Weighted Bipartite Graphs

Author

Çakıroḡlu, Olca A., Erten, Cesim, Karataş, Ömer, Sözdinler, Melih, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Demetrescu, Camil, editor

Published
2007
Full Text
View/download PDF

81. Finding a Dense-Core in Jellyfish Graphs

Author

Gonen, Mira, Ron, Dana, Weinsberg, Udi, Wool, Avishai, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bonato, Anthony, editor, and Chung, Fan R. K., editor

Published
2007
Full Text
View/download PDF

82. A P2P Architecture for Multimedia Content Retrieval

Author

Ardizzone, E., Gatani, L., La Cascia, M., Lo Re, G., Ortolani, M., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Cham, Tat-Jen, editor, Cai, Jianfei, editor, Dorai, Chitra, editor, Rajan, Deepu, editor, Chua, Tat-Seng, editor, and Chia, Liang-Tien, editor

Published
2006
Full Text
View/download PDF

83. Selection Enthusiasm

Author

Agrawal, A., Mitchell, I., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Wang, Tzai-Der, editor, Li, Xiaodong, editor, Chen, Shu-Heng, editor, Wang, Xufa, editor, Abbass, Hussein, editor, Iba, Hitoshi, editor, Chen, Guo-Liang, editor, and Yao, Xin, editor

Published
2006
Full Text
View/download PDF

84. Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem

Author

Chiarandini, Marco, Stützle, Thomas, Larsen, Kim S., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Almeida, Francisco, editor, Blesa Aguilera, María J., editor, Blum, Christian, editor, Moreno Vega, José Marcos, editor, Pérez Pérez, Melquíades, editor, Roli, Andrea, editor, and Sampels, Michael, editor

Published
2006
Full Text
View/download PDF

85. Evaluation of Texture Features for Analysis of Ovarian Follicular Development

Author

Bian, Na, Eramian, Mark. G., Pierson, Roger A., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Larsen, Rasmus, editor, Nielsen, Mads, editor, and Sporring, Jon, editor

Published
2006
Full Text
View/download PDF

86. Fast Measuring Particle Size by Using the Information of Particle Boundary and Shape

Author

Wang, Weixing, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Yeung, Daniel S., editor, Liu, Zhi-Qiang, editor, Wang, Xi-Zhao, editor, and Yan, Hong, editor

Published
2006
Full Text
View/download PDF

87. Biologically Motivated Perceptual Feature: Generalized Robust Invariant Feature

Author

Kim, Sungho, Kweon, In So, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Narayanan, P. J., editor, Nayar, Shree K., editor, and Shum, Heung-Yeung, editor

Published
2006
Full Text
View/download PDF

88. Face Tracking Using Mean-Shift Algorithm: A Fuzzy Approach for Boundary Detection

Author

Dadgostar, Farhad, Sarrafzadeh, Abdolhossein, Overmyer, Scott P., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tao, Jianhua, editor, Tan, Tieniu, editor, and Picard, Rosalind W., editor

Published
2005
Full Text
View/download PDF

89. Local Entropic Graphs for Globally-Consistent Graph Matching

Author

Lozano, Miguel Angel, Escolano, Francisco, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Brun, Luc, editor, and Vento, Mario, editor

Published
2005
Full Text
View/download PDF

90. A Computational Pixelization Model Based on Selective Attention for Artificial Visual Prosthesis

Author

Li, Ruonan, Zhang, Xudong, Hu, Guangshu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Wang, Lipo, editor, Chen, Ke, editor, and Ong, Yew Soon, editor

Published
2005
Full Text
View/download PDF

91. A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction

Author

Forster, Michael, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Pach, János, editor

Published
2005
Full Text
View/download PDF

92. Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs

Author

Naor, Moni, Nussboim, Asaf, Tromer, Eran, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Kilian, Joe, editor

Published
2005
Full Text
View/download PDF

93. Regularization Kernels and Softassign

Author

Lozano, Miguel Angel, Escolano, Francisco, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Sanfeliu, Alberto, editor, Martínez Trinidad, José Francisco, editor, and Carrasco Ochoa, Jesús Ariel, editor

Published
2004
Full Text
View/download PDF

94. PDA-Based Text Localization System Using Client/Server Architecture

Author

Park, Anjin, Jung, Keechul, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Zhang, Chengqi, editor, W. Guesgen, Hans, editor, and Yeap, Wai-Kiang, editor

Published
2004
Full Text
View/download PDF

95. A Significant Improvement of Softassign with Diffusion Kernels

Author

Lozano, Miguel Angel, Escolano, Francisco, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Fred, Ana, editor, Caelli, Terry M., editor, Duin, Robert P. W., editor, Campilho, Aurélio C., editor, and de Ridder, Dick, editor

Published
2004
Full Text
View/download PDF

96. The Optimal Deployment of Filters to Limit Forged Address Attacks in Communication Networks

Author

Mofya, Enock Chisonge, Smith, Jonathan Cole, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Chen, Hsinchun, editor, Moore, Reagan, editor, Zeng, Daniel D., editor, and Leavitt, John, editor

Published
2004
Full Text
View/download PDF

97. A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem

Author

Demiroz, Betul, Topcuoglu, Haluk, Kandemir, Mahmut, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Gottlieb, Jens, editor, and Raidl, Günther R., editor

Published
2004
Full Text
View/download PDF

100. Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms

Author

Mitchell, Brian S., Mancoridis, Spiros, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Cantú-Paz, Erick, editor, Foster, James A., editor, Deb, Kalyanmoy, editor, Davis, Lawrence David, editor, Roy, Rajkumar, editor, O’Reilly, Una-May, editor, Beyer, Hans-Georg, editor, Standish, Russell, editor, Kendall, Graham, editor, Wilson, Stewart, editor, Harman, Mark, editor, Wegener, Joachim, editor, Dasgupta, Dipankar, editor, Potter, Mitch A., editor, Schultz, Alan C., editor, Dowsland, Kathryn A., editor, Jonoska, Natasha, editor, and Miller, Julian, editor

Published
2003
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results