Sciweavers

2304 search results - page 179 / 461
» On the Vulnerability of Large Graphs
Sort
View
CIKM
2006
Springer
15 years 10 months ago
On the structural properties of massive telecom call graphs: findings and implications
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
Amit Anil Nanavati, Siva Gurumurthy, Gautam Das, D...
ISSAC
2007
Springer
121views Mathematics» more  ISSAC 2007»
16 years 20 days ago
A comparative analysis of parallel disk-based Methods for enumerating implicit graphs
It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and...
Eric Robinson, Daniel Kunkle, Gene Cooperman
STACS
2007
Springer
16 years 19 days ago
Hard Metrics from Cayley Graphs of Abelian Groups
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
Ilan Newman, Yuri Rabinovich
SIBGRAPI
2006
IEEE
16 years 16 days ago
Actively Illuminated Objects using Graph-Cuts
This paper addresses the problem of foreground extraction using active illumination and graph-cut optimization. Our approach starts by detecting image regions that are likely to b...
Asla Medeiros Sá, Marcelo Bernardes Vieira,...
IEAAIE
2005
Springer
16 years 1 days ago
Analyzing Multi-level Spatial Association Rules Through a Graph-Based Visualization
Association rules discovery is a fundamental task in spatial data mining where data are naturally described at multiple levels of granularity. ARES is a spatial data mining system ...
Annalisa Appice, Paolo Buono