Sciweavers

2569 search results - page 249 / 514
» Approximate Objects and Approximate Theories
Sort
View
NIPS
2007
15 years 8 months ago
Agreement-Based Learning
The learning of probabilistic models with many hidden variables and nondecomposable dependencies is an important and challenging problem. In contrast to traditional approaches bas...
Percy Liang, Dan Klein, Michael I. Jordan
WSC
2004
15 years 8 months ago
Efficient Simulation-Based Discrete Optimization
In many practical applications of simulation it is desirable to optimize the levels of integer or binary variables that are inputs for the simulation model. In these cases, the ob...
Seth D. Guikema, Rachel A. Davidson, Zehra Ç...
163
Voted
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 6 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...
ICASSP
2011
IEEE
14 years 10 months ago
CLT for eigen-inference methods in cognitive radios
This article provides a central limit theorem for a consistent estimator of the population eigenvalues of a class of sample covariance matrices. An exact expression as well as an ...
Jianfeng Yao, Romain Couillet, Jamal Najim, Eric M...
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
15 years 10 months ago
Multi-Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...