1629 search results - page 275 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
KONVENS
2000
15 years 1 months ago
2000
This paper presents details of the RWTH large vocabulary continuous speech recognition system used in the VERBMOBIL spontaneous speech translation system. In particular, we report...
ISPD
2000
ACM
15 years 2 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
EOR
2008
14 years 10 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
173
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract--With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones...
KDD
2009
ACM
15 years 4 months ago
2009
ACM
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...