Sciweavers

5022 search results - page 84 / 1005
» Data structures and problem solving using Java
Sort
View
ICFP
2001
ACM
15 years 9 months ago
Extensible Algebraic Datatypes with Defaults
A major problem for writing extensible software arises when recursively defined datatypes and operations on these types have to be extended simultaneously without modifying existi...
Matthias Zenger, Martin Odersky
JSC
2010
155views more  JSC 2010»
14 years 8 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
JSCIC
2006
81views more  JSCIC 2006»
14 years 9 months ago
An Improvement of a Recent Eulerian Method for Solving PDEs on General Geometries
We improve upon a method introduced in (Bertalmio et. al. JCP 2001) for solving evolution PDEs on codimension-one surfaces in RN. As in the original method, by representing the su...
John B. Greer
PODC
2010
ACM
14 years 11 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
CVPR
2005
IEEE
15 years 12 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade