Sciweavers

2880 search results - page 240 / 576
» Approximate Range Searching
Sort
View
TCAD
2008
68views more  TCAD 2008»
15 years 3 months ago
Highly Efficient Gradient Computation for Density-Constrained Analytical Placement
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
Jason Cong, Guojie Luo, Eric Radke
CGVR
2010
15 years 2 months ago
Triangulation-free 3D Reconstruction from LiDAR Data
We demonstrate a generic method for visualization of high-resolution unorganized and noisy 3D data points with a surface of significantly lower resolution. To this effect, we feed...
Yusuf Sahillioglu
OL
2011
190views Neural Networks» more  OL 2011»
14 years 11 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal
WWW
2011
ACM
14 years 11 months ago
Learning to re-rank: query-dependent image re-ranking using click data
Our objective is to improve the performance of keyword based image search engines by re-ranking their baseline results. To this end, we address three limitations of existing searc...
Vidit Jain, Manik Varma
ICML
2006
IEEE
16 years 4 months ago
Using inaccurate models in reinforcement learning
In the model-based policy search approach to reinforcement learning (RL), policies are found using a model (or "simulator") of the Markov decision process. However, for ...
Pieter Abbeel, Morgan Quigley, Andrew Y. Ng