10608 search results - page 565 / 2122 » Complexity of O'Hara's Algorithm |
168
click to vote
CSR
2007
Springer
16 years 1 months ago
2007
Springer
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
210
click to vote
IJCNN
2006
IEEE
16 years 1 months ago
2006
IEEE
— Support Vector Machine has been well received in machine learning community with its theoretical as well as practical value. However, since its training time complexity is cubi...
155
click to vote
WIA
2004
Springer
16 years 13 days ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
192
click to vote
ATAL
2003
Springer
16 years 10 days ago
2003
Springer
A team of agents planning to perform a complex task make a number of interrelated decisions as they determine precisely how that complex task will be performed. The decision set i...
170
click to vote
RT
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. There has been great success in speeding up global illumination computation in diffuse environments. The concept of clustering allows radiosity computations even for scen...