Sciweavers

1095 search results - page 113 / 219
» Preprocessing of Intractable Problems
Sort
View
ASUNAM
2011
IEEE
12 years 10 months ago
DisNet: A Framework for Distributed Graph Computation
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
Ryan Lichtenwalter, Nitesh V. Chawla
MST
2007
167views more  MST 2007»
13 years 9 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
CIMCA
2008
IEEE
14 years 4 months ago
The C++ Hybrid Imperative Meta-Programmer: CHIMP
Neither the C nor the C++ languages support reflection and their meta-programming capabilities are very limited. Both of these problems can be addressed by adding a preprocessing...
John Kenyon, Frederick C. Harris Jr., Sergiu M. Da...
ICPR
2008
IEEE
14 years 4 months ago
Illumination invariant spatio-colorimetric normalization
In the context of object recognition, it is useful to extract, from the images, efficient indexes that are insensitive to the illumination conditions, to the camera scale factor ...
Damien Muselet, Alain Trémeau
ICANN
2005
Springer
14 years 3 months ago
Reinforcement Learning in MirrorBot
For this special session of EU projects in the area of NeuroIT, we will review the progress of the MirrorBot project with special emphasis on its relation to reinforcement learning...
Cornelius Weber, David Muse, Mark Elshaw, Stefan W...