Sciweavers

1174 search results - page 51 / 235
» Optimizing generics is easy!
Sort
View
GPCE
2005
Springer
14 years 3 months ago
Optimizing Marshalling by Run-Time Program Generation
Saving the internal data of an application in an external form is called marshalling. A generic marshaller is difficult to optimize because the format of the data that will be mars...
Baris Aktemur, Joel Jones, Samuel N. Kamin, Lars C...
EVOW
2006
Springer
14 years 1 months ago
A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
Olfa Sammoud, Sébastien Sorlin, Christine S...
CVPR
2005
IEEE
14 years 12 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...
ICMCS
2006
IEEE
144views Multimedia» more  ICMCS 2006»
14 years 4 months ago
Optimal Requantization-Based Rate Adaptation for H.264
Bit rate adaptation is one of the most important types of video transcoding. With H.264 becoming the predominant video codec of choice in video coding and streaming, prudent ratea...
Bo Shen
BC
2006
102views more  BC 2006»
13 years 10 months ago
The Optimal Human Ventral Stream from Estimates of the Complexity of Visual Objects
The part of the primate visual cortex responsible for the recognition of objects is parcelled into about a dozen areas organized somewhat hierarchically (the region is called the v...
Mark A. Changizi