Sciweavers

240 search results - page 12 / 48
» Efficient Variants of the Backward-Oracle-Matching Algorithm
Sort
View
ADHOC
2006
116views more  ADHOC 2006»
13 years 8 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
ICMLA
2004
13 years 10 months ago
Satisficing Q-learning: efficient learning in problems with dichotomous attributes
In some environments, a learning agent must learn to balance competing objectives. For example, a Q-learner agent may need to learn which choices expose the agent to risk and whic...
Michael A. Goodrich, Morgan Quigley
ICML
2001
IEEE
14 years 9 months ago
Multiple Instance Regression
This paper introduces multiple instance regression, a variant of multiple regression in which each data point may be described by more than one vector of values for the independen...
Soumya Ray, David Page
ICDE
2012
IEEE
291views Database» more  ICDE 2012»
12 years 7 months ago
Efficiently Monitoring Top-k Pairs over Sliding Windows
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin, We...
ECML
2006
Springer
13 years 10 months ago
Efficient Large Scale Linear Programming Support Vector Machines
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
Suvrit Sra