272 search results - page 44 / 55 » Minimal Function Graphs are not Instrumented |
121
Voted
GRAPHICSINTERFACE
2008
15 years 4 months ago
2008
We address the problem of reconstructing the background of a scene from a set of photographs featuring several occluding objects. We assume that the photographs are obtained from ...
123
click to vote
KDD
2004
ACM
16 years 3 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
155
Voted
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
105
click to vote
ICRA
2003
IEEE
15 years 8 months ago
2003
IEEE
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
114
Voted
MSS
2000
IEEE
15 years 7 months ago
2000
IEEE
We describe a real implementation of a software component that manages caching of files from a tertiary storage management system to a large disk cache developed for use in the a...