Sciweavers

16626 search results - page 3307 / 3326
» Computing is a natural science
Sort
View
CGF
2002
135views more  CGF 2002»
15 years 1 months ago
Slow Growing Subdivision (SGS) in Any Dimension: Towards Removing the Curse of Dimensionality
In recent years subdivision methods have been one of the most successful techniques applied to the multi-resolution representation and visualization of surface meshes. Extension t...
Valerio Pascucci
COLING
2002
15 years 1 months ago
The LinGO Redwoods Treebank: Motivation and Preliminary Applications
The LinGO Redwoods initiative is a seed activity in the design and development of a new type of treebank. While several medium- to large-scale treebanks exist for English (and for...
Stephan Oepen, Kristina Toutanova, Stuart M. Shieb...
COLING
2002
15 years 1 months ago
Applying an NVEF Word-Pair Identifier to the Chinese Syllable-to-Word Conversion Problem
Syllable-to-word (STW) conversion is important in Chinese phonetic input methods and speech recognition. There are two major problems in the STW conversion: (1) resolving the ambi...
Jia-Lin Tsai, Wen-Lian Hsu
COR
2007
86views more  COR 2007»
15 years 1 months ago
Sourcing with random yields and stochastic demand: A newsvendor approach
We studied a supplier selection problem, where a buyer, while facing random demand, is to decide ordering quantities from a set of suppliers with different yields and prices.We pr...
Shitao Yang, Jian Yang, Layek Abdel-Malek
CORR
2007
Springer
217views Education» more  CORR 2007»
15 years 1 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
« Prev « First page 3307 / 3326 Last » Next »