Sciweavers

271 search results - page 24 / 55
» Graph limits and parameter testing
Sort
View
CVPR
2007
IEEE
14 years 12 months ago
Image Segmentation by Probabilistic Bottom-Up Aggregation and Cue Integration
We present a parameter free approach that utilizes multiple cues for image segmentation. Beginning with an image, we execute a sequence of bottom-up aggregation steps in which pix...
Sharon Alpert, Meirav Galun, Ronen Basri, Achi Bra...
BMCBI
2008
84views more  BMCBI 2008»
13 years 10 months ago
poolHiTS: A Shifted Transversal Design based pooling strategy for high-throughput drug screening
Background: A key goal of drug discovery is to increase the throughput of small molecule screens without sacrificing screening accuracy. High-throughput screening (HTS) in drug di...
Raghunandan M. Kainkaryam, Peter J. Woolf
SAC
2011
ACM
13 years 4 months ago
A quasi-Newton acceleration for high-dimensional optimization algorithms
Abstract In many statistical problems, maximum likelihood estimation by an EM or MM algorithm suffers from excruciatingly slow convergence. This tendency limits the application of ...
Hua Zhou, David Alexander, Kenneth Lange
WSDM
2010
ACM
254views Data Mining» more  WSDM 2010»
14 years 7 months ago
Learning Influence Probabilities In Social Networks
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a ...
Amit Goyal 0002, Francesco Bonchi, Laks V. S. Laks...
ISSS
2000
IEEE
128views Hardware» more  ISSS 2000»
14 years 2 months ago
Hardware Synthesis from SPDF Representation for Multimedia Applications
Even though high-level hardware synthesis from dataflow graphs becomes popular in designing DSP systems, currently used dataflow models are inefficient to deal with emerging multi...
Chanik Park, Soonhoi Ha