1477 search results - page 87 / 296 » On Graph Problems in a Semi-streaming Model |
117
click to vote
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
113
click to vote
SAT
2004
Springer
15 years 6 months ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
121
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
144
click to vote
TIP
2010
14 years 12 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
123
click to vote
ISAAC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...