1232 search results - page 51 / 247 » Digraphs: theory, algorithms and applications |
169
click to vote
CASC
2006
Springer
15 years 9 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
154
click to vote
SCALESPACE
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents an algorithm for computing stability of top-points in scale-space. The potential usefulness of top-points in scalespace has already been shown for a number of a...
193
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Minimax-regret preference elicitation allows intelligent decisions to be made on behalf of people facing risky choices. Standard gamble queries, a vital tool in this type of prefe...
165
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
139
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...