Sciweavers

5169 search results - page 380 / 1034
» Locality approximation using time
Sort
View
ICIAR
2005
Springer
16 years 10 days ago
Compressing 2-D Shapes Using Concavity Trees
Concavity trees have been known for quite some time as structural descriptors of 2-D shape; however, they haven’t been explored further until recently. This paper shows how 2-D s...
Ossama El Badawy, Mohamed S. Kamel
154
Voted
ICCS
2004
Springer
16 years 6 days ago
Improved Sampling for Biological Molecules Using Shadow Hybrid Monte Carlo
Shadow Hybrid Monte Carlo (SHMC) is a new method for sampling the phase space of large biological molecules. It improves sampling by allowing larger time steps and system sizes in ...
Scott S. Hampton, Jesús A. Izaguirre
AIA
2007
15 years 8 months ago
Adaptive preference elicitation for top-K recommendation tasks using GAI-networks
The enormous number of questions needed to acquire a full preference model when the size of the outcome space is large forces us to work with partial models that approximate the u...
Sérgio R. de M. Queiroz
DAC
2009
ACM
16 years 7 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
16 years 7 days ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar