Sciweavers

3367 search results - page 228 / 674
» Incremental assignment problem
Sort
View
SAC
2011
ACM
14 years 10 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
214
Voted
ICDE
1996
IEEE
126views Database» more  ICDE 1996»
16 years 5 months ago
Using Object-Oriented Principles to Optimize Update Propagation to Materialized Views
View materialization is known to be a valuable technique for performance optimization in relational databases, and much work has been done addressing the problem of consistently m...
Harumi A. Kuno, Elke A. Rundensteiner
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 4 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
135
Voted
CSCLP
2007
Springer
15 years 10 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth
COMPGEOM
2003
ACM
15 years 9 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk