5100 search results - page 205 / 1020 » The Linear Complexity of a Graph |
103
click to vote
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
89
Voted
JSSPP
2005
Springer
15 years 6 months ago
2005
Springer
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
89
Voted
NIPS
2007
15 years 2 months ago
2007
We propose a compact, low power VLSI network of spiking neurons which can learn to classify complex patterns of mean firing rates on–line and in real–time. The network of int...
73
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
—We motivate the problem of designing a subset of the edge weights in a graph, to shape the spectrum of an associated linear time-invariant dynamics. We address a canonical desig...