Sciweavers

866 search results - page 133 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
IJCV
2002
156views more  IJCV 2002»
13 years 9 months ago
Trinocular Stereo Using Shortest Paths and the Ordering Constraint
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
Motilal Agrawal
ATMOS
2010
308views Optimization» more  ATMOS 2010»
13 years 8 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
CIKM
2010
Springer
13 years 7 months ago
Identifying hotspots on the real-time web
We study the problem of automatically identifying“hotspots” on the real-time web. Concretely, we propose to identify highly-dynamic ad-hoc collections of users – what we ref...
Krishna Yeswanth Kamath, James Caverlee
COMSIS
2010
13 years 6 months ago
Metrics for evaluation of metaprogram complexity
The concept of complexity is used in many areas of computer science and software engineering. Software complexity metrics can be used to evaluate and compare quality of software de...
Robertas Damasevicius, Vytautas Stuikys
ICML
2007
IEEE
14 years 10 months ago
Structural alignment based kernels for protein structure classification
Structural alignments are the most widely used tools for comparing proteins with low sequence similarity. The main contribution of this paper is to derive various kernels on prote...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...