3105 search results - page 247 / 621 » The Path-Packing Structure of Graphs |
137
click to vote
ADBIS
2004
Springer
15 years 9 months ago
2004
Springer
The old idea of navigation in a database is revisited with two essential changes: we address Web users rather than programmers and the navigation is accomplished as a visual metaph...
136
click to vote
DAC
1999
ACM
15 years 8 months ago
1999
ACM
We present a methodology for the watermarking of synchronous sequential circuits that makes it possible to identify the authorship of designs by imposing a digital watermark on th...
136
click to vote
VLDB
1993
ACM
15 years 8 months ago
1993
ACM
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
163
click to vote
CISS
2007
IEEE
15 years 8 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
180
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...