3280 search results - page 445 / 656 » MiTAP for real users, real data, real problems |
172
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
164
click to vote
ICDM
2007
IEEE
16 years 26 days ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
169
click to vote
ICMCS
2006
IEEE
16 years 17 days ago
2006
IEEE
Recently, 3D face recognition algorithms have outperformed 2D conventional approaches by adding depth data to the problem. However, independently of the nature (2D or 3D) of the a...
190
click to vote
PCM
2001
Springer
15 years 11 months ago
2001
Springer
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
165
click to vote
NIPS
2008
15 years 8 months ago
2008
Unexpected stimuli are a challenge to any machine learning algorithm. Here we identify distinct types of unexpected events, focusing on 'incongruent events' when 'g...