Sciweavers

1957 search results - page 275 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
15 years 10 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
14 years 11 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
MMS
2000
14 years 9 months ago
Dynamic Quota-Based Admission Control with Sub-Rating in Multimedia Servers
An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the Quality of Service (QoS) requirements o...
Sheng-Tzong Cheng, Chi-Ming Chen, Ing-Ray Chen
COMGEO
1999
ACM
14 years 9 months ago
Simplifying spline models
We present a new approach for simplifying models composed of rational spline patches. Given an input model, the algorithm computes a new approximation of the model in terms of cub...
M. Gopi, Dinesh Manocha
PVLDB
2010
112views more  PVLDB 2010»
14 years 8 months ago
On Triangulation-based Dense Neighborhood Graphs Discovery
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
Nan Wang, Jingbo Zhang, Kian-Lee Tan, Anthony K. H...