Sciweavers

28888 search results - page 71 / 5778
» Computability and complexity in analysis
Sort
View
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
13 years 6 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
UIST
2006
ACM
14 years 1 months ago
Robust computer vision-based detection of pinching for one and two-handed gesture input
We present a computer vision technique to detect when the user brings their thumb and forefinger together (a pinch gesture) for close-range and relatively controlled viewing circu...
Andrew D. Wilson
INFOCOM
2003
IEEE
14 years 1 months ago
Computing the Types of the Relationships between Autonomous Systems
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
Giuseppe Di Battista, Maurizio Patrignani, Maurizi...
ISEM
2006
91views more  ISEM 2006»
13 years 8 months ago
Computational experimentations in market and supply-chain co-design: a mixed agent approach
The synthetic environment for analysis and simulations (SEAS) is a computational experimentation environment that mimics real life economies, with multiple interlinked markets, mul...
Alok R. Chaturvedi, Shailendra Raj Mehta, Daniel R...
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou