Sciweavers

724 search results - page 50 / 145
» Some Structural Complexity Aspects of Neural Computation
Sort
View
COMPGEOM
2010
ACM
14 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
P2P
2007
IEEE
113views Communications» more  P2P 2007»
14 years 3 months ago
Handling Network Partitions and Mergers in Structured Overlay Networks
Structured overlay networks form a major class of peerto-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-s...
Tallat M. Shafaat, Ali Ghodsi, Seif Haridi
CNSR
2005
IEEE
210views Communications» more  CNSR 2005»
13 years 11 months ago
A Framework for Self-Management of Hybrid Wireless Networks Using Autonomic Computing Principles
The dramatic increase in the number of mobile subscribers has put a significant resource and service provisioning strain on current cellular networks in particular in terms of mu...
Chong Shen, Dirk Pesch, James Irvine
IJCNN
2008
IEEE
14 years 3 months ago
Efficient and low-complexity image coding with the lifting scheme and modified SPIHT
—In this paper, we propose an efficient and low complexity image coding algorithm based on the lifting wavelet transform and listless modified SPIHT (LWT-LMSPIHT). LWT-LMSPIHT jo...
Hong Pan, Wan-Chi Siu, Ngai-Fong Law
IJCNN
2006
IEEE
14 years 3 months ago
How Not to Evaluate a Developmental System
—Computational models of development aim to describe the mechanisms that underlie the acquisition of new skills or the emergence of new capabilities. The strength of a model is j...
Frederick Shic, Brian Scassellati