Sciweavers

2880 search results - page 73 / 576
» Approximate Range Searching
Sort
View
ESA
2008
Springer
111views Algorithms» more  ESA 2008»
15 years 5 months ago
Parallel Imaging Problem
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
Thành Nguyen, Éva Tardos
NIPS
1998
15 years 4 months ago
Gradient Descent for General Reinforcement Learning
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
Leemon C. Baird III, Andrew W. Moore
TMI
1998
91views more  TMI 1998»
15 years 2 months ago
A Vision-Based Technique for Objective Assessment of Burn Scars
—In this paper a method for the objective assessment of burn scars is proposed. The quantitative measures developed in this research provide an objective way to calculate elastic...
Leonid V. Tsap, Dmitry B. Goldgof, Sudeep Sarkar, ...
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 1 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
14 years 7 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi