Sciweavers

3131 search results - page 379 / 627
» Generalized connection caching
Sort
View
SDM
2008
SIAM
164views Data Mining» more  SDM 2008»
15 years 8 months ago
Randomizing Social Networks: a Spectrum Preserving Approach
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...
Xiaowei Ying, Xintao Wu
SODA
2008
ACM
128views Algorithms» more  SODA 2008»
15 years 8 months ago
Analysis of greedy approximations with nonsubmodular potential functions
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
DAGSTUHL
2003
15 years 8 months ago
Reliable Distance and Intersection Computation Using Finite Precision Geometry
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
Katja Bühler, Eva Dyllong, Wolfram Luther
AAAI
1998
15 years 8 months ago
Boosting in the Limit: Maximizing the Margin of Learned Ensembles
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
Adam J. Grove, Dale Schuurmans
UAI
1994
15 years 8 months ago
Generating New Beliefs from Old
In previous work [BGHK92, BGHK93], we have studied the random-worlds approach--a particular (and quite powerful) method for generating degrees of belief (i.e., subjective probabil...
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, ...