Sciweavers

11484 search results - page 307 / 2297
» Modeling in the Large and Modeling in the Small
Sort
View
142
Voted
KDD
2003
ACM
109views Data Mining» more  KDD 2003»
16 years 7 months ago
Experimental design for solicitation campaigns
Data mining techniques are routinely used by fundraisers to select those prospects from a large pool of candidates who are most likely to make a financial contribution. These tech...
Uwe F. Mayer, Armand Sarkissian
CAIP
2007
Springer
143views Image Analysis» more  CAIP 2007»
16 years 27 days ago
A Level Set Bridging Force for the Segmentation of Dendritic Spines
The paper focusses on a group of segmentation problems dealing with 3D data sets showing thin objects that appear disconnected in the data due to partial volume effects or a large...
Karsten Rink, Klaus D. Tönnies
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
16 years 26 days ago
Hill climbing on discrete HIFF: exploring the role of DNA transposition in long-term artificial evolution
We show how a random mutation hill climber that does multilevel selection utilizes transposition to escape local optima on the discrete Hierarchical-If-And-Only-If (HIFF) problem....
Susan Khor
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
16 years 7 days ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
SIGIR
2010
ACM
15 years 10 months ago
Context-aware ranking in web search
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused ...
Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, En...