Sciweavers

14165 search results - page 519 / 2833
» The generalized two-server problem
Sort
View
WWW
2011
ACM
15 years 1 months ago
EntityTagger: automatically tagging entities with descriptive phrases
We consider the problem of entity tagging: given one or more named entities from a specific domain, the goal is to automatically associate descriptive phrases, referred to as eta...
Kaushik Chakrabarti, Surajit Chaudhuri, Tao Cheng,...
COGSR
2011
105views more  COGSR 2011»
15 years 1 months ago
Inductive rule learning on the knowledge level
We present an application of the analytical inductive programming system Igor to learning sets of recursive rules from positive experience. We propose that this approach can be us...
Ute Schmid, Emanuel Kitzelmann
JMMA
2010
90views more  JMMA 2010»
15 years 1 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke
NETWORK
2010
122views more  NETWORK 2010»
15 years 1 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
SIAMMAX
2010
103views more  SIAMMAX 2010»
15 years 1 months ago
On Chebyshev Polynomials of Matrices
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
Vance Faber, Jörg Liesen, Petr Tichý