305 search results - page 57 / 61 » Similarity relations in concept lattices |
90
Voted
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
122
click to vote
SIGIR
1992
ACM
15 years 1 months ago
1992
ACM
ct We describe work on the visualization of bibliographic data and, to aid in this task, the application of numerical techniques for multidimensional scaling. Many areas of scienti...
119
click to vote
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
We propose a novel conception language for exploring the results retrieved by several internet search services (like search engines) that cluster retrieved documents. The goal is ...
76
Voted
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
DATESO
2007
14 years 11 months ago
2007
We address a problem of updating XML documents having their XML schema described by a Document Type Definition (DTD) without breaking their validity. We present a way how to expre...