1405 search results - page 64 / 281 » Popularity at Minimum Cost |
WADS
2005
Springer
15 years 3 months ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
IJCNLP
2004
Springer
15 years 3 months ago
2004
Springer
We present a method to automatically detect sentence boundaries(SBs) in Japanese speech transcriptions. Our method uses a Japanese morphological analyzer that is based on a cost c...
BMVC
2000
14 years 11 months ago
2000
A new parameter estimation method is presented, applicable to many computer vision problems. It operates under the assumption that the data (typically image point locations) are a...
117
click to vote
GLOBECOM
2008
IEEE
14 years 10 months ago
2008
IEEE
Optimal network provisioning is the process of equipping the network with the devices and resources needed to support all traffic demands while minimizing the network cost. Optical...
106
click to vote
CONSTRAINTS
2008
14 years 9 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...