Sciweavers

3656 search results - page 33 / 732
» Compact Location Problems
Sort
View
STACS
2007
Springer
14 years 4 months ago
Compact Forbidden-Set Routing
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Bruno Courcelle, Andrew Twigg
3DPVT
2002
IEEE
204views Visualization» more  3DPVT 2002»
14 years 2 months ago
Half-Edge Multi-Tessellation: A Compact Representation for Multi-Resolution Tetrahedral Meshes
This paper deals with the problem of analyzing and visualizing volume data sets of large size. To this aim, we define a three-dimensional multi-resolution model based on unstruct...
Emanuele Danovaro, Leila De Floriani
ICASSP
2011
IEEE
13 years 1 months ago
On the design of matched orthonormal wavelets with compact support
We develop new algorithms for designing matched wavelets and matched scaling functions using a new parametrization of compactly supported orthonormal wavelets that is developed in...
Mohamed F. Mansour
PAMI
2012
12 years 9 days ago
Aggregating Local Image Descriptors into Compact Codes
— This paper addresses the problem of large-scale image search. Three constraints have to be taken into account: search accuracy, efficiency, and memory usage. We first present...
Hervé Jégou, Florent Perronnin, Matt...
CVPR
2010
IEEE
14 years 7 months ago
Aggregating local descriptors into a compact image representation
We address the problem of image search on a very large scale, where three constraints have to be considered jointly: the accuracy of the search, its efficiency, and the memory usag...
Hervé Jégou, Matthijs Douze, Cordelia Schmid and...