1554 search results - page 56 / 311 » Parameterized Complexity and Approximation Algorithms |
118
Voted
SGP
2003
15 years 4 months ago
2003
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
152
Voted
CCR
2006
15 years 2 months ago
2006
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
150
click to vote
KSEM
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
110
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
126
Voted
TOG
2008
15 years 2 months ago
2008
We present a novel shadow map parameterization to reduce perspective aliasing artifacts for both point and directional light sources. We derive the aliasing error equations for bo...