Sciweavers

879 search results - page 174 / 176
» Designing Closer to the Edge
Sort
View

Publication
314views
13 years 3 months ago
On the use of discrete Pascal transform in hiding data in images
The Discrete Pascal Transform (DPT) has been proved remarkably useful for edge detection, filter design, discrete-time signal interpolation and data hiding. In the present work a n...
E. E. Varsaki, V. Fotopoulos and A. N. Skodras
ASUNAM
2011
IEEE
12 years 7 months ago
MultiAspectForensics: Pattern Mining on Large-Scale Heterogeneous Networks with Tensor Analysis
—Modern applications such as web knowledge base, network traffic monitoring and online social networks have made available an unprecedented amount of network data with rich type...
Koji Maruhashi, Fan Guo, Christos Faloutsos
SIGCOMM
2012
ACM
11 years 10 months ago
LIFEGUARD: practical repair of persistent route failures
The Internet was designed to always find a route if there is a policycompliant path. However, in many cases, connectivity is disrupted despite the existence of an underlying vali...
Ethan Katz-Bassett, Colin Scott, David R. Choffnes...
KDD
2012
ACM
229views Data Mining» more  KDD 2012»
11 years 10 months ago
Finding trendsetters in information networks
Influential people have an important role in the process of information diffusion. However, there are several ways to be influential, for example, to be the most popular or the...
Diego Sáez-Trumper, Giovanni Comarela, Virg...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 10 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...