Sciweavers

3422 search results - page 376 / 685
» Random Subset Optimization
Sort
View
121
Voted
JCB
2000
87views more  JCB 2000»
15 years 4 months ago
Comparison of Additive Trees Using Circular Orders
It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting speci...
Vladimir Makarenkov, Bruno Leclerc
AI
1999
Springer
15 years 4 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
MVA
2002
175views Computer Vision» more  MVA 2002»
15 years 3 months ago
Augmented geophysical data interpretation through automated velocity picking in semblance velocity images
Velocity Picking is the problem of picking velocity-time pairs based on a coherence metric between multiple seismic signals. Coherence as a function of velocity and time can be ex...
J. Ross Beveridge, Charlie Ross, L. Darrell Whitle...
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
15 years 2 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...
TIP
2010
155views more  TIP 2010»
15 years 2 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He