Sciweavers

3894 search results - page 778 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 10 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell
MA
2010
Springer
94views Communications» more  MA 2010»
13 years 9 months ago
On sparse estimation for semiparametric linear transformation models
: Semiparametric linear transformation models have received much attention due to its high flexibility in modeling survival data. A useful estimating equation procedure was recent...
Hao Helen Zhang, Wenbin Lu, Hansheng Wang
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
13 years 9 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...
WIOPT
2010
IEEE
13 years 9 months ago
Reservation policies for revenue maximization from secondary spectrum access in cellular networks
We consider the problem of providing opportunistic spectrum access to secondary users in wireless cellular networks. From the standpoint of spectrum license holders, achieving ben...
Ashraf Al Daoud, Murat Alanyali, David Starobinski
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
13 years 8 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala