Sciweavers

5221 search results - page 166 / 1045
» An On-line Problem Database
Sort
View
107
Voted
JGAA
2007
135views more  JGAA 2007»
14 years 10 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
ADBIS
2009
Springer
135views Database» more  ADBIS 2009»
14 years 8 months ago
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
Maxim Kormilitsin, Rada Chirkova, Yahya Fathi, Mat...
ICCV
2009
IEEE
14 years 8 months ago
A study on automatic age estimation using a large database
In this paper we study some problems related to human age estimation using a large database. First, we study the influence of gender on age estimation based on face representation...
Guodong Guo, Guowang Mu, Yun Fu, Charles R. Dyer, ...
AROBOTS
2011
14 years 5 months ago
Human motion database with a binary tree and node transition graphs
— Database of human motion has been widely used for recognizing human motion and synthesizing humanoid motions. In this paper, we propose a data structure for storing and extract...
Katsu Yamane, Yoshifumi Yamaguchi, Yoshihiko Nakam...
SIGMOD
2005
ACM
215views Database» more  SIGMOD 2005»
15 years 10 months ago
Nested intervals tree encoding in SQL
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
Vadim Tropashko