Sciweavers

2826 search results - page 140 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
15 years 5 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
15 years 9 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
ICDM
2010
IEEE
105views Data Mining» more  ICDM 2010»
15 years 2 months ago
On the Vulnerability of Large Graphs
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
Hanghang Tong, B. Aditya Prakash, Charalampos E. T...
CPHYSICS
2007
81views more  CPHYSICS 2007»
15 years 4 months ago
The ATLAS computing model: status, plans and future possibilities
The ATLAS Collaboration[1] has been preparing for Large Hadron Collider (LHC) running for more than 20 years. By summer of 2007 we expect the first colliding beams of protons and...
Shawn McKee
CGA
2010
15 years 1 months ago
Newdle: Interactive Visual Exploration of Large Online News Collections
In this paper, we present a novel visual analytics system named Newdle with a focus on exploring large online news collections when the semantics of the individual news articles ha...
Jing Yang, Dongning Luo, Yujie Liu