Sciweavers

898 search results - page 65 / 180
» Transitions of the Pre-Symmetry Set
Sort
View
PVLDB
2010
118views more  PVLDB 2010»
15 years 4 months ago
Global Detection of Complex Copying Relationships Between Sources
Web technologies have enabled data sharing between sources but also simplified copying (and often publishing without proper attribution). The copying relationships can be complex...
Xin Dong, Laure Berti-Equille, Yifan Hu, Divesh Sr...
RSA
2010
107views more  RSA 2010»
15 years 4 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
CORR
2010
Springer
342views Education» more  CORR 2010»
15 years 3 months ago
Canonizable Partial Order Generators
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
Mateus de Oliveira Oliveira
TIP
2011
123views more  TIP 2011»
15 years 1 months ago
Spatial Sparsity-Induced Prediction (SIP) for Images and Video: A Simple Way to Reject Structured Interference
We propose a prediction technique that is geared toward forming successful estimates of a signal based on a correlated anchor signal that is contaminated with complex interference...
Gang Hua, Onur G. Guleryuz
ICC
2011
IEEE
237views Communications» more  ICC 2011»
14 years 6 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li