7106 search results - page 1206 / 1422 » Restricted Complexity, General Complexity |
145
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
156
click to vote
GFKL
2007
Springer
15 years 9 months ago
2007
Springer
In many classification applications, Support Vector Machines (SVMs) have proven to be highly performing and easy to handle classifiers with very good generalization abilities. Howe...
193
click to vote
ERSHOV
2009
Springer
15 years 9 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
167
click to vote
SIGGRAPH
1995
ACM
15 years 8 months ago
1995
ACM
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals...
130
click to vote
NOSSDAV
1991
Springer
15 years 8 months ago
1991
Springer
One of the most important emerging developments for improving the user/computer interface has been the addition of multimedia facilities to high-performance workstations. Although...