Sciweavers

14518 search results - page 40 / 2904
» Two Problems for Sophistication
Sort
View
DCG
2007
65views more  DCG 2007»
13 years 7 months ago
Paths of Trains with Two-Wheeled Cars
In this paper we study the following simple and mind-puzzling problem: Can a model train car, which runs along an intricate track complete a full cycle around it? In our paper a t...
Luis Montejano, Jorge Urrutia
JNS
2007
55views more  JNS 2007»
13 years 7 months ago
Two-Dimensional Infinite Prandtl Number Convection: Structure of Bifurcated Solutions
Abstract. This paper examines the bifurcation and structure of the bifurcated solutions of the two-dimensional infinite Prandtl number convection problem. The existence of a bifur...
Jungho Park
JSYML
1998
64views more  JSYML 1998»
13 years 7 months ago
Some Two-Cardinal Results for O-Minimal Theories
We examine two-cardinal problems for the class of O-minimal theories. We prove that an O-minimal theory which admits some (κ, λ) must admit every (κ , λ ). We also prove that ...
Timothy Bays
MOC
1998
82views more  MOC 1998»
13 years 7 months ago
Vortex method for two dimensional Euler equations in bounded domains with boundary correction
The vortex method for the initial-boundary value problems of the Euler equations for incompressible flow is studied. A boundary correction technique is introduced to generate seco...
Lung-an Ying
SODA
2010
ACM
178views Algorithms» more  SODA 2010»
14 years 5 months ago
Tree Embeddings for Two-Edge-Connected Network Design
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi