Sciweavers

2912 search results - page 566 / 583
» Logistic Model Trees
Sort
View
SPAA
2005
ACM
14 years 3 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
CIKM
2005
Springer
14 years 3 months ago
Learning to summarise XML documents using content and structure
Documents formatted in eXtensible Markup Language (XML) are becoming increasingly available in collections of various document types. In this paper, we present an approach for the...
Massih-Reza Amini, Anastasios Tombros, Nicolas Usu...
GFKL
2005
Springer
142views Data Mining» more  GFKL 2005»
14 years 3 months ago
Near Similarity Search and Plagiarism Analysis
Abstract. Existing methods to text plagiarism analysis mainly base on “chunking”, a process of grouping a text into meaningful units each of which gets encoded by an integer nu...
Benno Stein, Sven Meyer zu Eissen
MIDDLEWARE
2005
Springer
14 years 3 months ago
Distributed collaboration for event detection in wireless sensor networks
With the advancement of technology in micro-electronics and wireless communication, small miniature devices called sensor nodes can be used to perform various tasks by forming the...
A. V. U. Phani Kumar, Adi Mallikarjuna Reddy V, D....
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
14 years 3 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...