Sciweavers

4781 search results - page 274 / 957
» Complexity at large
Sort
View
COMPGEOM
2006
ACM
15 years 9 months ago
An upper bound on the average size of silhouettes
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides,...
Marc Glisse
GFKL
2005
Springer
128views Data Mining» more  GFKL 2005»
15 years 9 months ago
Automatic Extension of Feature-based Semantic Lexicons via Contextual Attributes
We describe how a feature-based semantic lexicon can be automatically extended using large, unstructured text corpora. Experiments are carried out using the lexicon HaGenLex and th...
Chris Biemann, Rainer Osswald
123
Voted
IDA
2003
Springer
15 years 9 months ago
Guided Incremental Construction of Belief Networks
Because uncertain reasoning is often intractable, it is hard to reason with a large amount of knowledge. One solution to this problem is to specify a set of possible models, some s...
Charles A. Sutton, Brendan Burns, Clayton T. Morri...
ECAL
2001
Springer
15 years 8 months ago
The Use of Latent Semantic Indexing to Identify Evolutionary Trajectories in Behaviour Space
This paper describes the simulation of a foraging agent in an environment with a simple ecological structure, alternatively using one of three different control systems with varyi...
Ian R. Edmonds
DAC
1998
ACM
15 years 8 months ago
Global Routing with Crosstalk Constraints
—Due to the scaling down of device geometry and increasing of frequency in deep submicron designs, crosstalk between interconnection wires has become an important issue in very l...
Hai Zhou, D. F. Wong