Sciweavers

884 search results - page 131 / 177
» Algorithms for Implicit Deformable Models
Sort
View
SIGIR
2010
ACM
15 years 6 months ago
Inferring user intent in web search by exploiting social annotations
In this paper, we present a folksonomy-based approach for implicit user intent extraction during a Web search process. We present a number of result re-ranking techniques based on...
Jose M. Conde, David Vallet, Pablo Castells
140
Voted
ECCV
2010
Springer
15 years 5 months ago
Optimum Subspace Learning and Error Correction for Tensors
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...
AAAI
1994
15 years 3 months ago
Tractable Planning with State Variables by Exploiting Structural Restrictions
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
Peter Jonsson, Christer Bäckström
MICRO
2000
IEEE
107views Hardware» more  MICRO 2000»
15 years 2 months ago
An integrated approach to accelerate data and predicate computations in hyperblocks
To exploit increased instruction-level parallelism available in modern processors, we describe the formation and optimization of tracenets, an integrated approach to reducing the ...
Alexandre E. Eichenberger, Waleed Meleis, Suman Ma...
125
Voted
CGF
1999
86views more  CGF 1999»
15 years 2 months ago
Generalized View-Dependent Simplification
We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detailbased renderings of large models. The algorithm proceeds by preproces...
Jihad El-Sana, Amitabh Varshney