Sciweavers

3993 search results - page 488 / 799
» Matchmaking for Structured Objects
Sort
View
ICML
2010
IEEE
15 years 5 months ago
Submodular Dictionary Selection for Sparse Representation
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
Andreas Krause, Volkan Cevher
SMA
2010
ACM
204views Solid Modeling» more  SMA 2010»
15 years 4 months ago
Topologically correct reconstruction of tortuous contour forests
Electrophysiological modeling of dendrites and other neurological processes is generally done in a simplified manner, by treating these structures as a series of cylinders (aka ca...
John Edwards, Chandrajit L. Bajaj
CGF
2010
153views more  CGF 2010»
15 years 4 months ago
Localized Delaunay Refinement for Sampling and Meshing
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
Tamal K. Dey, Joshua A. Levine, A. Slatton
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 4 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
EOR
2010
92views more  EOR 2010»
15 years 4 months ago
A survey of variants and extensions of the resource-constrained project scheduling problem
The resource-constrained project scheduling problem (RCPSP) consists of activities that must be scheduled subject to precedence and resource constraints such that the makespan is ...
Sönke Hartmann, Dirk Briskorn