10608 search results - page 580 / 2122 » Complexity of O'Hara's Algorithm |
191
click to vote
SARA
2005
Springer
16 years 19 days ago
2005
Springer
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
166
click to vote
COMPSAC
2003
IEEE
16 years 13 days ago
2003
IEEE
With the rise of distributed e-commerce in recent years, demand for automated negotiation has increased. In turn, this has facilitated a demand for ever more complex algorithms to...
222
click to vote
COMPGEOM
2010
ACM
16 years 7 days ago
2010
ACM
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
175
click to vote
CP
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
214
click to vote
TCS
2008
15 years 7 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...