2512 search results - page 283 / 503 » Learning from Highly Structured Data by Decomposition |
135
click to vote
CVPR
2010
IEEE
16 years 16 days ago
2010
IEEE
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
145
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper describes a framework for providing the ability to use multiple specialized data parallel libraries and/or languages within a single application. The ability to use mul...
143
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
128
click to vote
SAC
2005
ACM
15 years 9 months ago
2005
ACM
: Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption i...
105
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Attribute interactions are the irreducible dependencies between attributes. Interactions underlie feature relevance and selection, the structure of joint probability and classific...