Sciweavers

4781 search results - page 28 / 957
» Complexity at large
Sort
View
SIGCOMM
2012
ACM
11 years 10 months ago
AutoNetkit: simplifying large scale, open-source network experimentation
We present a methodology that brings simplicity to large and comt labs by using abstraction. The networking community has appreciated the value of large scale test labs to explore...
Simon Knight, Askar Jaboldinov, Olaf Maennel, Iain...
WETICE
1998
IEEE
13 years 12 months ago
Efficient Security for Large and Dynamic Multicast Groups
Proposals for multicast security that have been published so far are complex, often require trust in network components or are inefficient. In this paper we propose a series of no...
Germano Caronni, Marcel Waldvogel, Dan Sun, Bernha...
AI
2005
Springer
14 years 1 months ago
Real-Time Decision Making for Large POMDPs
Abstract. In this paper, we introduce an approach called RTBSS (RealTime Belief Space Search) for real-time decision making in large POMDPs. The approach is based on a look-ahead s...
Sébastien Paquet, Ludovic Tobin, Brahim Cha...
SIGGRAPH
2000
ACM
13 years 11 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
14 years 9 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010