Sciweavers

2304 search results - page 459 / 461
» On the Vulnerability of Large Graphs
Sort
View
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 2 months ago
Physical expander in Virtual Tree Overlay
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valer...
ICDE
2011
IEEE
281views Database» more  ICDE 2011»
12 years 11 months ago
Declarative analysis of noisy information networks
—There is a growing interest in methods for analyzing data describing networks of all types, including information, biological, physical, and social networks. Typically the data ...
Walaa Eldin Moustafa, Galileo Namata, Amol Deshpan...
INFOCOM
2011
IEEE
12 years 11 months ago
Continuous multi-dimensional top-k query processing in sensor networks
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
Hongbo Jiang, Jie Cheng, Dan Wang, Chonggang Wang,...
CVIU
2011
12 years 11 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 3 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...