Results 1  10
of
198,187
Enhanced hypertext categorization using hyperlinks
, 1998
"... A major challenge in indexing unstructured hypertext databases is to automatically extract metadata that enables structured search using topic taxonomies, circumvents keyword ambiguity, and improves the quality of search and profilebased routing and filtering. Therefore, an accurate classifier is ..."
Abstract

Cited by 454 (8 self)
 Add to MetaCart
is an essential component of a hypertext database. Hyperlinks pose new problems not addressed in the extensive text classification literature. Links clearly contain highquality semantic clues that are lost upon a purely termbased classifier, but exploiting link information is nontrivial because it is noisy
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
, 2007
"... A fullrank matrix A ∈ IR n×m with n < m generates an underdetermined system of linear equations Ax = b having infinitely many solutions. Suppose we seek the sparsest solution, i.e., the one with the fewest nonzero entries: can it ever be unique? If so, when? As optimization of sparsity is combin ..."
Abstract

Cited by 427 (35 self)
 Add to MetaCart
A fullrank matrix A ∈ IR n×m with n < m generates an underdetermined system of linear equations Ax = b having infinitely many solutions. Suppose we seek the sparsest solution, i.e., the one with the fewest nonzero entries: can it ever be unique? If so, when? As optimization of sparsity
A classification of schemabased matching approaches
 JOURNAL ON DATA SEMANTICS
, 2005
"... Schema/ontology matching is a critical problem in many application domains, such as, semantic web, schema/ontology integration, data warehouses, ecommerce, catalog matching, etc. Many diverse solutions to the matching problem have been proposed so far. In this paper we present a taxonomy of schema ..."
Abstract

Cited by 385 (21 self)
 Add to MetaCart
Schema/ontology matching is a critical problem in many application domains, such as, semantic web, schema/ontology integration, data warehouses, ecommerce, catalog matching, etc. Many diverse solutions to the matching problem have been proposed so far. In this paper we present a taxonomy of schema
Improvements to Platt’s SMO Algorithm for SVM Classifier Design
, 2001
"... This article points out an important source of inefficiency in Platt’s sequential minimal optimization (SMO) algorithm that is caused by the use of a single threshold value. Using clues from the KKT conditions for the dual problem, two threshold parameters are employed to derive modifications of SMO ..."
Abstract

Cited by 271 (11 self)
 Add to MetaCart
This article points out an important source of inefficiency in Platt’s sequential minimal optimization (SMO) algorithm that is caused by the use of a single threshold value. Using clues from the KKT conditions for the dual problem, two threshold parameters are employed to derive modifications
On the Fewest Nets Problem for Convex Polyhedra
"... Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edges? Shephard’s conjecture says that this number is always 1, but it’s still open. The fewest nets problem asks to provide ..."
Abstract
 Add to MetaCart
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edges? Shephard’s conjecture says that this number is always 1, but it’s still open. The fewest nets problem asks
CLUE
, 2000
"... The views expressed in this report are those discussed during the workshop. They do not necessarily represent the views of the IGBP/IHDPLUCC project, the European ..."
Abstract
 Add to MetaCart
The views expressed in this report are those discussed during the workshop. They do not necessarily represent the views of the IGBP/IHDPLUCC project, the European
Representing graph metrics with fewest edges
 IN PROCEEDINGS: 20TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
, 2003
"... We consider the problem of obtaining compressed representations for graph metrics by adding extra ("Steiner") vertices and removing edges, while preserving distances. The compression factor achieved is the ratio k between the number of edges in the original graph and the number in the comp ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We consider the problem of obtaining compressed representations for graph metrics by adding extra ("Steiner") vertices and removing edges, while preserving distances. The compression factor achieved is the ratio k between the number of edges in the original graph and the number
ON FINDING ORIENTATIONS WITH FEWEST NUMBER OF VERTICES WITH
"... ABSTRACT. Given an undirected graph, each of the two endvertices of an edge can “own ” the edge. Call a vertex “poor”, if it owns at most one edge. We give a polynomial time algorithm for the problem of finding an assignment of owners to the edges which minimizes the number of poor vertices. In the ..."
Abstract
 Add to MetaCart
ABSTRACT. Given an undirected graph, each of the two endvertices of an edge can “own ” the edge. Call a vertex “poor”, if it owns at most one edge. We give a polynomial time algorithm for the problem of finding an assignment of owners to the edges which minimizes the number of poor vertices
Results 1  10
of
198,187