Sciweavers

103 search results - page 19 / 21
» Pattern avoidance in binary trees
Sort
View
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
14 years 7 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar
SPIRE
2005
Springer
14 years 3 months ago
Cache-Conscious Collision Resolution in String Hash Tables
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
Nikolas Askitis, Justin Zobel
PR
2007
142views more  PR 2007»
13 years 9 months ago
Visual guided navigation for image retrieval
In this work, we are interested in technologies that will allow users to actively browse and navigate large image databases and to retrieve images through interactive fast browsin...
Guoping Qiu, Jeremy Morris, Xunli Fan
APSEC
2001
IEEE
14 years 1 months ago
Orchestrating Computations on the World-Wide Web
Word processing software, email, and spreadsheet have revolutionized office activities. There are many other office tasks that are amenable to automation, such as: scheduling a vi...
Jayadev Misra, Harrick M. Vin
WCNC
2008
IEEE
14 years 4 months ago
Arbutus: Network-Layer Load Balancing for Wireless Sensor Networks
—The hot spot problem is a typical byproduct of the many-to-one traffic pattern that characterizes most wireless sensor networks: the nodes with the best channel to the sink are ...
Daniele Puccinelli, Martin Haenggi