10988 search results - page 364 / 2198 » Algorithmic Folding Complexity |
138
click to vote
STOC
1994
ACM
15 years 9 months ago
1994
ACM
Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they becom...
138
Voted
SODA
2003
ACM
15 years 6 months ago
2003
ACM
We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdiv...
131
Voted
FOCM
2008
15 years 5 months ago
2008
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
154
Voted
CGI
1998
IEEE
15 years 9 months ago
1998
IEEE
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
157
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
In this study, a novel multidimensional time series classification technique, namely support feature machine (SFM), is proposed. SFM is inspired by the optimization model of suppo...