Sciweavers

7536 search results - page 372 / 1508
» Localized Components Analysis
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
A robust descriptor based on Weber's Law
Inspired by Weber's Law, this paper proposes a simple, yet very powerful and robust local descriptor, Weber Local Descriptor (WLD). It is based on the fact that human percept...
Jie Chen, Shiguang Shan, Guoying Zhao, Xilin Chen,...
GPCE
2007
Springer
16 years 26 days ago
Oz/K: a kernel language for component-based open programming
Programming in an open environment remains challenging because it requires combining modularity, security, concurrency, distribution, and dynamicity. In this paper, we propose an ...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...
CGF
2000
97views more  CGF 2000»
15 years 6 months ago
Collaboration between Heterogeneous Stand-alone 3-D Graphical Applications
We describe the Scene-Graph-As-Bus technique (SGAB), the first step in a staircase of solutions for sharing software components for virtual environments. The goals of SGAB are to ...
Robert C. Zeleznik, Loring Holden, Michael V. Capp...
WWW
2005
ACM
16 years 7 months ago
Improving Web search efficiency via a locality based static pruning method
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
Edleno Silva de Moura, Célia Francisca dos ...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 7 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi