8141 search results - page 1274 / 1629 » Higher Order Generalization |
177
click to vote
IM
2008
15 years 6 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
148
click to vote
IPL
2008
15 years 6 months ago
2008
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
172
click to vote
IS
2008
15 years 6 months ago
2008
Performing data mining tasks in streaming data is considered a challenging research direction, due to the continuous data evolution. In this work, we focus on the problem of clust...
159
click to vote
JAPLL
2008
15 years 6 months ago
2008
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
159
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This presentation studies the logical properties of how this new information...