Sciweavers

5329 search results - page 228 / 1066
» The Weighted Majority Algorithm
Sort
View
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 6 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy
IJCV
2006
115views more  IJCV 2006»
15 years 6 months ago
Object Recognition as Many-to-Many Feature Matching
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...
M. Fatih Demirci, Ali Shokoufandeh, Yakov Keselman...
CAGD
2005
116views more  CAGD 2005»
15 years 6 months ago
A sharpness dependent filter for mesh smoothing
In this paper, we propose a sharpness dependent filter design based on the fairing of surface normal, whereby the filtering algorithm automatically selects a filter. This may be a...
Chun-Yen Chen, Kuo-Young Cheng
ICASSP
2010
IEEE
15 years 3 months ago
Context-adaptive pixel based prediction for intra frame encoding
Intra prediction is one effective method to remove the spatial redundancies in intra frame coding. Better intra prediction will result in the residual with less energy, which will...
Yongbing Zhang, Li Zhang, Siwei Ma, Debin Zhao, We...
DCG
2011
15 years 1 months ago
Small Grid Embeddings of 3-Polytopes
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
Ares Ribó Mor, Günter Rote, Andr&eacut...