Sciweavers

3134 search results - page 138 / 627
» Computing full disjunctions
Sort
View
93
Voted
CI
2007
45views more  CI 2007»
15 years 3 months ago
Market-Based Approaches to Optimization
Abstract. We present a general discussion of what constitutes a marketoriented approach to optimization. We demonstrate how a general framework can be used to conceptually improve ...
Maria Karlsson, Fredrik Ygge, Arne Andersson
92
Voted
COLING
2002
15 years 3 months ago
Entering Text with a Four-Button Device
This paper presents the design of a text-entry device that requires only four buttons. Such a device is applicable as the text interface of portable machines and as an interface f...
Kumiko Tanaka-Ishii, Yusuke Inutsuka, Masato Takei...
134
Voted
MOC
2002
98views more  MOC 2002»
15 years 3 months ago
Avoiding the order reduction of Runge-Kutta methods for linear initial boundary value problems
Abstract. A new strategy to avoid the order reduction of Runge-Kutta methods when integrating linear, autonomous, nonhomogeneous initial boundary value problems is presented. The s...
Mari Paz Calvo, Cesar Palencia
129
Voted
TVCG
1998
133views more  TVCG 1998»
15 years 3 months ago
Novel View Synthesis by Cascading Trilinear Tensors
—We present a new method for synthesizing novel views of a 3D scene from two or three reference images in full correspondence. The core of this work is the use and manipulation o...
Shai Avidan, Amnon Shashua
102
Voted
IPL
2010
69views more  IPL 2010»
15 years 2 months ago
A simple representation of subwords of the Fibonacci word
We introduce a representation of subwords of the infinite Fibonacci word f∞ by a specific concatenation of finite Fibonacci words. It is unique and easily computable by backwa...
Bartosz Walczak