Sciweavers

2239 search results - page 39 / 448
» Computing with abstract matrix structures
Sort
View
95
Voted
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
16 years 5 days ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
14 years 10 months ago
The Computational Structure of Progress Conditions
Abstract. Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n...
Gadi Taubenfeld
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
15 years 3 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
OL
2008
78views more  OL 2008»
14 years 11 months ago
Slopes of shadow prices and Lagrange multipliers
Abstract Manyeconomicmodels andoptimizationproblems generate(endogenous) shadow prices--alias dual variables or Lagrange multipliers. Frequently the "slopes" of resulting...
Sjur Didrik Flåm, Hubertus Th. Jongen, Olive...
NDJFL
2010
14 years 6 months ago
Numerical Abstraction via the Frege Quantifier
l Abstraction via the Frege Quantifier G. Aldo Antonelli Abstract This paper presents a formalization of first-order aritharacterizing the natural numbers as abstracta of the equin...
Gian Aldo Antonelli