447 search results - page 54 / 90 » Approximation Algorithms for Directed Steiner Problems |
119
click to vote
DCG
2008
15 years 1 months ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
140
click to vote
UAI
1998
15 years 2 months ago
1998
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
114
click to vote
CIAC
2010
Springer
15 years 4 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
112
click to vote
GMP
2006
IEEE
15 years 7 months ago
2006
IEEE
In geometric modeling and processing, computer graphics and computer vision, smooth surfaces are approximated by discrete triangular meshes reconstructed from sample points on the...
108
click to vote
GLOBECOM
2007
IEEE
15 years 5 months ago
2007
IEEE
Wireless sensor networks have been widely used in many surveillance applications. Due to the importance of sensor nodes in such applications, certain level of protection needs to b...