Sciweavers

1052 search results - page 153 / 211
» Improved CHAID algorithm for document structure modelling
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
11 years 10 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 1 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
PODC
2009
ACM
14 years 8 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
WSDM
2010
ACM
215views Data Mining» more  WSDM 2010»
14 years 5 months ago
Boilerplate Detection using Shallow Text Features
In addition to the actual content Web pages consist of navigational elements, templates, and advertisements. This boilerplate text typically is not related to the main content, ma...
Christian Kohlschütter, Peter Fankhauser, Wol...
CORR
2010
Springer
197views Education» more  CORR 2010»
13 years 6 months ago
Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents
—Autonomous wireless agents such as unmanned aerial vehicles, mobile base stations, or self-operating wireless nodes present a great potential for deployment in next-generation w...
Walid Saad, Zhu Han, Tamer Basar, Mérouane ...