658 search results - page 5 / 132 » Lower bounds for sorting networks |
COCO
2003
Springer
14 years 3 days ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
STOC
2012
ACM
11 years 9 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
COLT
1993
Springer
13 years 11 months ago
1993
Springer
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
IEEECIT
2006
IEEE
14 years 28 days ago
2006
IEEE
Localization is a basic and critical requirement for wireless sensor network applications, e.g. target tracking, monitoring and intrusion detection. In the received signal strengt...