Sciweavers

1162 search results - page 215 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
JACM
2007
121views more  JACM 2007»
13 years 7 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
AI
2011
Springer
13 years 3 months ago
Learning qualitative models from numerical data
Qualitative models are often a useful abstraction of the physical world. Learning qualitative models from numerical data sible way to obtain such an abstraction. We present a new ...
Jure Zabkar, Martin Mozina, Ivan Bratko, Janez Dem...
WISTP
2010
Springer
14 years 2 months ago
A Probabilistic Diffusion Scheme for Anomaly Detection on Smartphones
Widespread use and general purpose computing capabilities of next generation smartphones make them the next big targets of malicious software (malware) and security attacks. Given ...
Tansu Alpcan, Christian Bauckhage, Aubrey-Derrick ...
SDM
2009
SIAM
331views Data Mining» more  SDM 2009»
14 years 5 months ago
Privacy Preservation in Social Networks with Sensitive Edge Weights.
With the development of emerging social networks, such as Facebook and MySpace, security and privacy threats arising from social network analysis bring a risk of disclosure of con...
Jie Wang, Jinze Liu, Jun Zhang, Lian Liu
CVPR
2010
IEEE
14 years 4 months ago
Finding Dots: Segmentation as Popping out Regions from Boundaries
Many applications need to segment out all small round regions in an image. This task of finding dots can be viewed as a region segmentation problem where the dots form one regio...
Elena Bernardis, Stella Yu