411 search results - page 76 / 83 » A New Approach to the Rectilinear Steiner Tree Problem |
PKDD
1999
Springer
15 years 1 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
70
Voted
ICVS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract— An autonomous mobile robot must face the correspondence or data association problem in order to carry out tasks like place recognition or unknown environment mapping. I...
102
click to vote
GG
2004
Springer
15 years 3 months ago
2004
Springer
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
94
Voted
PAKDD
2001
ACM
15 years 2 months ago
2001
ACM
Information extraction (IE) from semi-structured Web documents is a critical issue for information integration systems on the Internet. Previous work in wrapper induction aim to so...