Sciweavers

191 search results - page 25 / 39
» Online Aggregation over Trees
Sort
View
ESA
1999
Springer
105views Algorithms» more  ESA 1999»
13 years 12 months ago
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
Friedhelm Meyer auf der Heide, Berthold Vöcki...
SAC
2005
ACM
14 years 1 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 7 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
ASIAN
2007
Springer
174views Algorithms» more  ASIAN 2007»
14 years 1 months ago
Combining Heterogeneous Classifiers for Network Intrusion Detection
Extensive use of computer networks and online electronic data and high demand for security has called for reliable intrusion detection systems. A repertoire of different classifier...
Ali Borji
WWW
2008
ACM
14 years 8 months ago
Mashups for semantic user profiles
In this paper, we discuss challenges and provide solutions for capturing and maintaining accurate models of user profiles using semantic web technologies, by aggregating and shari...
Riddhiman Ghosh, Mohamed Dekhil