Sciweavers

1887 search results - page 229 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
14 years 9 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher
WWW
2009
ACM
14 years 10 months ago
Advertising keyword generation using active learning
This paper proposes an efficient relevance feedback based interactive model for keyword generation in sponsored search advertising. We formulate the ranking of relevant terms as a...
Hao Wu, Guang Qiu, Xiaofei He, Yuan Shi, Mingcheng...
ICCV
1999
IEEE
14 years 10 months ago
Curve Finder Combining Perceptual Grouping and a Kalman Like Fitting
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
Frederic Guichard, Jean-Philippe Tarel
AMAI
2005
Springer
13 years 9 months ago
A SAT approach to query optimization in mediator systems
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
Steven David Prestwich, Stéphane Bressan
IEAAIE
1998
Springer
14 years 1 months ago
Generating Heuristics to Control Configuration Processes
Abstract. Configuration is the process of composing a system from a set of components such that the system fulfills a set of desired demands. The configuration process relies on a ...
Benno Stein