Sciweavers

520 search results - page 35 / 104
» Reductions Between Expansion Problems
Sort
View
DAGSTUHL
2006
13 years 10 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
CRV
2011
IEEE
352views Robotics» more  CRV 2011»
12 years 8 months ago
Conformative Filter: A Probabilistic Framework for Localization in Reduced Space
— Algorithmic problem reduction is a fundamental approach to problem solving in many fields, including robotics. To solve a problem using this scheme, we must reduce the problem...
Chatavut Viriyasuthee, Gregory Dudek
IPPS
2007
IEEE
14 years 3 months ago
A global address space framework for locality aware scheduling of block-sparse computations
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
Sriram Krishnamoorthy, Ümit V. Çataly&...
SIGIR
2010
ACM
14 years 20 days ago
Query similarity by projecting the query-flow graph
Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as que...
Ilaria Bordino, Carlos Castillo, Debora Donato, Ar...
ICIP
2005
IEEE
14 years 10 months ago
Saveface and Sirface: appearance-based recognition of faces and facial expressions
The problem of appearance-based recognition of faces and facial expressions is addressed. Previous work on sliced inverse regression (SIR) resulted in the formulation of an appear...
Yangrong Ling, Suchendra M. Bhandarkar, Xiangrong ...