2907 search results - page 196 / 582 » Presentations of Structures in Admissible Sets |
184
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
260
click to vote
ICDE
2001
IEEE
16 years 8 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
168
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
146
click to vote
KBSE
2008
IEEE
16 years 29 days ago
2008
IEEE
Run-time monitoring can provide important insights about a program’s behavior and, for simple properties, it can be done efficiently. Monitoring properties describing sequences...
177
click to vote
CSL
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...