154 search results - page 14 / 31 » Near Best Tree Approximation |
CVPR
1997
IEEE
14 years 9 months ago
1997
IEEE
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
CORR
2010
Springer
13 years 6 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...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
TREC
2007
13 years 8 months ago
2007
Relaxed Online Support Vector Machines (ROSVMs) have recently been proposed as an efficient methodology for attaining an approximate SVM solution for streaming data such as the on...
MONET
2006
13 years 7 months ago
2006
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...