Sciweavers

4112 search results - page 344 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
VLDB
2005
ACM
121views Database» more  VLDB 2005»
16 years 7 months ago
Join operations in temporal databases
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, t...
Dengfeng Gao, Christian S. Jensen, Richard T. Snod...
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 7 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
ICDM
2006
IEEE
227views Data Mining» more  ICDM 2006»
16 years 28 days ago
Incremental Mining of Sequential Patterns over a Stream Sliding Window
Incremental mining of sequential patterns from data streams is one of the most challenging problems in mining data streams. However, previous work of mining sequential patterns fr...
Chin-Chuan Ho, Hua-Fu Li, Fang-Fei Kuo, Suh-Yin Le...
IMSCCS
2006
IEEE
16 years 27 days ago
A Numerical Approach of Direct-SIMPLE Deduced Pressure Equations to Simulations of Transport Phenomena During Shaped Casting
The properties of a LPAPI-matrix derived from an extended Direct-SIMPLE scheme are demonstrated. It is shown that such LPAPI-matrix for a 3D strong P V coupling problem is difficu...
Daming Xu, Jun Ni
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 7 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi