Results 1  10
of
35,638
Maxcoloring and online coloring with bandwidths on interval graphs
, 2008
"... Given a graph G = (V, E) and positive integral vertex weights w: V → N, the maxcoloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2,..., Ck, minimize ∑k i=1 maxv∈C w(v). This problem, restricted to interval graphs, arises whenever there is a need i to design dedic ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
an interval graph G uses no more than 8 · χ(G) colors, significantly improving the bound of 26·χ(G) by Kierstead and Qin (Discrete Math., 144, 1995). We also show that the maxcoloring problem is NPhard. The problem of online coloring of intervals with bandwidths is a simultaneous generalization of online
Buffer Minimization Using MaxColoring
, 2003
"... Given a graph G = (V, E) and positive integral vertex weights w: V → N, the maxcoloring problem seeks to find a proper vertex coloring of G whose color classes C_1, C_2, ..., C_k, minimize i=1 max v#C i w(v). This problem, restricted to interval graphs, arises whenever there is a need to d ..."
Abstract

Cited by 37 (2 self)
 Add to MetaCart
Given a graph G = (V, E) and positive integral vertex weights w: V → N, the maxcoloring problem seeks to find a proper vertex coloring of G whose color classes C_1, C_2, ..., C_k, minimize i=1 max v#C i w(v). This problem, restricted to interval graphs, arises whenever there is a need
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
The click modular router
, 2001
"... Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple router functions like packet classification, queueing, scheduling, and interfacing with network devic ..."
Abstract

Cited by 1155 (28 self)
 Add to MetaCart
devices. A router configuration is a directed graph with elements at the vertices; packets flow along the edges of the graph. Configurations are written in a declarative language that supports userdefined abstractions. This language is both readable by humans and easily manipulated by tools. We present
SemiSupervised Learning Literature Survey
, 2006
"... We review the literature on semisupervised learning, which is an area in machine learning and more generally, artificial intelligence. There has been a whole
spectrum of interesting ideas on how to learn from both labeled and unlabeled data, i.e. semisupervised learning. This document is a chapter ..."
Abstract

Cited by 757 (8 self)
 Add to MetaCart
chapter excerpt from the author’s
doctoral thesis (Zhu, 2005). However the author plans to update the online version frequently to incorporate the latest development in the field. Please obtain the latest
version at http://www.cs.wisc.edu/~jerryzhu/pub/ssl_survey.pdf
Online Coloring of Intervals with Bandwidth
"... Abstract. Motivated by resource allocation problems in communication networks, we considerthe problem of online interval coloring in the case where the intervals have weights in [0, 1] andthe total weight of intersecting intervals with the same color must not exceed 1. We present anonline algorithm ..."
Abstract
 Add to MetaCart
for this problem that achieves a constant competitive ratio. Our algorithm is a combination of an optimal online algorithm for coloring interval graphs and FirstFit coloring,for which we generalize the analysis of Kierstead to the case of nonunit bandwidth. 1 Introduction Online coloring of intervals is a
A survey of generalpurpose computation on graphics hardware
, 2007
"... The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware acompelling platform for computationally demanding tasks in awide variety of application domains. In this report, we describe, summarize, and analyze the l ..."
Abstract

Cited by 545 (18 self)
 Add to MetaCart
The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware acompelling platform for computationally demanding tasks in awide variety of application domains. In this report, we describe, summarize, and analyze the latest research in mapping generalpurpose computation to graphics hardware. We begin with the technical motivations that underlie generalpurpose computation on graphics processors (GPGPU) and describe the hardware and software developments that have led to the recent interest in this field. We then aim the main body of this report at two separate audiences. First, we describe the techniques used in mapping generalpurpose computation to graphics hardware. We believe these techniques will be generally useful for researchers who plan to develop the next generation of GPGPU algorithms and techniques. Second, we survey and categorize the latest developments in generalpurpose application development on graphics hardware.
Wrapper Induction for Information Extraction
, 1997
"... The Internet presents numerous sources of useful informationtelephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user's behalf. However, these resources are usually ..."
Abstract

Cited by 612 (30 self)
 Add to MetaCart
The Internet presents numerous sources of useful informationtelephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user's behalf. However, these resources are usually formatted for use by people (e.g., the relevant content is embedded in HTML pages), so extracting their content is difficult. Wrappers are often used for this purpose. A wrapper is a procedure for extracting a particular resource's content. Unfortunately, handcoding wrappers is tedious. We introduce wrapper induction, a technique for automatically constructing wrappers. Our techniques can be described in terms of three main contributions. First, we pose the problem of wrapper construction as one of inductive learn...
Results 1  10
of
35,638