Sciweavers

1391 search results - page 214 / 279
» Optimally Sparse Frames
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
Joint data alignment up to (lossy) transformations
Joint data alignment is often regarded as a data simplification process. This idea is powerful and general, but raises two delicate issues. First, one must make sure that the usef...
Andrea Vedaldi, Gregorio Guidi, Stefano Soatto
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
16 years 1 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
VIS
2007
IEEE
199views Visualization» more  VIS 2007»
16 years 1 months ago
Topology, Accuracy, and Quality of Isosurface Meshes Using Dynamic Particles
Abstract-This paper describes a method for constructing isosurface triangulations of sampled, volumetric, three-dimensional scalar fields. The resulting meshes consist of triangles...
Miriah Meyer, Robert M. Kirby, Ross Whitaker
ICPR
2006
IEEE
16 years 29 days ago
Using Specularities to Recover Multiple Light Sources in the Presence of Texture
Recovering multiple point light sources from a sparse set of photographs in which objects of unknown texture can move is challenging. This is because both diffuse and specular ref...
Pascal Lagger, Pascal Fua
ICPR
2004
IEEE
16 years 29 days ago
A Hierarchical Projection Pursuit Clustering Algorithm
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
Alexei D. Miasnikov, Jayson E. Rome, Robert M. Har...