10608 search results - page 675 / 2122 » Complexity of O'Hara's Algorithm |
192
click to vote
COMPGEOM
2006
ACM
16 years 1 months ago
2006
ACM
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
183
Voted
ECOOP
2005
Springer
16 years 25 days ago
2005
Springer
There are many algorithms for concurrent garbage collection, but they are complex to describe, verify, and implement. This has resulted in a poor understanding of the relationships...
178
Voted
SWAT
2004
Springer
16 years 19 days ago
2004
Springer
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
203
Voted
DAWAK
1999
Springer
15 years 11 months ago
1999
Springer
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
181
Voted
AAAI
2008
15 years 9 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...