Sciweavers

879 search results - page 39 / 176
» Greedy Attribute Selection
Sort
View
TSP
2008
89views more  TSP 2008»
13 years 9 months ago
Noncooperative Eigencoding for MIMO Ad hoc Networks
A new noncooperative eigencoding algorithm is introduced for MIMO Ad hoc networks. The algorithm performs generalized waterfilling with respect to its transmit covariance matrix a...
Duong A. Hoang, Ronald A. Iltis
AIPS
2008
14 years 7 hour ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
14 years 9 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
DRM
2003
Springer
14 years 2 months ago
Constructing a virtual primary key for fingerprinting relational data
Agrawal and Kiernan’s watermarking technique for database relations [1] and Li et al’s fingerprinting extension [6] both depend critically on primary key attributes. Hence, t...
Yingjiu Li, Vipin Swarup, Sushil Jajodia
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 9 months ago
Near-Optimal Bayesian Active Learning with Noisy Observations
We tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypot...
Daniel Golovin, Andreas Krause, Debajyoti Ray