Sciweavers

7057 search results - page 1365 / 1412
» Tasks, domains, and languages
Sort
View
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
14 years 2 months ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen
CIKM
2005
Springer
14 years 2 months ago
Word sense disambiguation in queries
This paper presents a new approach to determine the senses of words in queries by using WordNet. In our approach, noun phrases in a query are determined first. For each word in th...
Shuang Liu, Clement T. Yu, Weiyi Meng
CP
2005
Springer
14 years 2 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell
GECCO
2005
Springer
149views Optimization» more  GECCO 2005»
14 years 2 months ago
There's more to a model than code: understanding and formalizing in silico modeling experience
Mapping biology into computation has both a domain specific aspect – biological theory – and a methodological aspect – model development. Computational modelers have implici...
Janet Wiles, Nicholas Geard, James Watson, Kai Wil...
ICALP
2005
Springer
14 years 2 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
« Prev « First page 1365 / 1412 Last » Next »