Sciweavers

2489 search results - page 245 / 498
» On the Subgroup Distance Problem
Sort
View
NETWORKS
2010
15 years 3 months ago
Network flow spanners
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
Feodor F. Dragan, Chenyu Yan
BMVC
2010
15 years 2 months ago
Pairwise Macropixel Comparison Can Work at Least as Well as Advanced Holistic Algorithms for Face Recognition
It is well known that, due to illumination effects and the registration/alignment problem, it does not make sense to compare the "values" of two single-pixels for face r...
Liang Chen
ACL
2009
15 years 2 months ago
Bypassed alignment graph for learning coordination in Japanese sentences
Past work on English coordination has focused on coordination scope disambiguation. In Japanese, detecting whether coordination exists in a sentence is also a problem, and the sta...
Hideharu Okuma, Kazuo Hara, Masashi Shimbo, Yuji M...
SIAMDM
2010
136views more  SIAMDM 2010»
14 years 11 months ago
Obnoxious Centers in Graphs
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...
Sergio Cabello, Günter Rote
SAC
2003
ACM
15 years 10 months ago
Manpower Scheduling with Time Windows
In this paper, we propose a manpower allocation model with time windows which is of practical interest to serviceman scheduling operations. Specifically, this problem originates f...
Andrew Lim, Brian Rodrigues, Lei Song