1162 search results - page 58 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
AAAI
2012
11 years 10 months ago
2012
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
CCGRID
2006
IEEE
14 years 2 months ago
2006
IEEE
Market-based resource management is becoming an emerging issue as the utilization of Grid computing is growing rapidly, particularly in the business field. In this paper, we prov...
ICIP
2006
IEEE
14 years 10 months ago
2006
IEEE
Background blurring is an effective way to both preserving privacy and keeping communication effective during video conferencing. This paper proposes a light weight real-time algo...
JSC
2006
13 years 8 months ago
2006
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...