Sciweavers

83 search results - page 13 / 17
» Boundary value problems on weighted networks
Sort
View
ALT
2004
Springer
14 years 4 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
NPL
2006
172views more  NPL 2006»
13 years 7 months ago
Adapting RBF Neural Networks to Multi-Instance Learning
In multi-instance learning, the training examples are bags composed of instances without labels, and the task is to predict the labels of unseen bags through analyzing the training...
Min-Ling Zhang, Zhi-Hua Zhou
ICDCS
2000
IEEE
13 years 12 months ago
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...
PAMI
2011
12 years 10 months ago
Meta-Recognition: The Theory and Practice of Recognition Score Analysis
Abstract—In this paper, we define meta-recognition, a performance prediction method for recognition algorithms, and examine the theoretical basis for its post-recognition score ...
Walter J. Scheirer, Anderson Rocha, Ross J. Michea...
MOBICOM
2004
ACM
14 years 27 days ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
Santosh Kumar, Ten-Hwang Lai, József Balogh