5022 search results - page 557 / 1005 » Data structures and problem solving using Java |
137
click to vote
CVPR
2010
IEEE
16 years 28 days ago
2010
IEEE
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
126
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
163
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
126
click to vote
ICONIP
2007
15 years 6 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
119
click to vote
SSDBM
2002
IEEE
15 years 9 months ago
2002
IEEE
We investigate the problem of searching similar multiattribute time sequences. Such sequences arise naturally in a number of medical, financial, video, weather forecast, and stoc...