Sciweavers

41472 search results - page 7985 / 8295
» or 2006
Sort
View
101
Voted
MLDM
2005
Springer
15 years 6 months ago
Using Clustering to Learn Distance Functions for Supervised Similarity Assessment
Assessing the similarity between objects is a prerequisite for many data mining techniques. This paper introduces a novel approach to learn distance functions that maximizes the c...
Christoph F. Eick, Alain Rouhana, Abraham Bagherje...
118
Voted
SEMWEB
2005
Springer
15 years 6 months ago
RelExt: A Tool for Relation Extraction from Text in Ontology Extension
Abstract. Domain ontologies very rarely model verbs as relations holding between concepts. However, the role of the verb as a central connecting element between concepts is undenia...
Alexander Schutz, Paul Buitelaar
99
Voted
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
15 years 6 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
WINE
2005
Springer
109views Economy» more  WINE 2005»
15 years 6 months ago
Subjective-Cost Policy Routing
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
Joan Feigenbaum, David R. Karger, Vahab S. Mirrokn...
151
Voted
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 6 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
« Prev « First page 7985 / 8295 Last » Next »