Sciweavers

4047 search results - page 802 / 810
» The Discrete Basis Problem
Sort
View
COMPUTER
2002
89views more  COMPUTER 2002»
13 years 7 months ago
A Pattern for Softcoded Values
rs use models or abstractions that hide low-level implementation details. Various kinds of representations such as data models, state-transition models, and dataflow models can hel...
Michael R. Blaha, Cheryl Smith
CORR
2002
Springer
105views Education» more  CORR 2002»
13 years 7 months ago
Effectiveness of Preference Elicitation in Combinatorial Auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
Benoît Hudson, Tuomas Sandholm
DKE
2002
113views more  DKE 2002»
13 years 7 months ago
A general strategy for decomposing topological invariants of spatial databases and an application
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...
Serafino Cicerone, Daniele Frigioni, Paolino Di Fe...
IJON
1998
140views more  IJON 1998»
13 years 7 months ago
Comment on "Discrete-time recurrent neural network architectures: A unifying review"
Paper [1] aimed at providing a unified presentation of neural network architectures. We show in the present comment (i) that the canonical form of recurrent neural networks presen...
Léon Personnaz, Gérard Dreyfus
PAMI
2002
122views more  PAMI 2002»
13 years 7 months ago
Analytic PCA Construction for Theoretical Analysis of Lighting Variability in Images of a Lambertian Object
We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. Si...
Ravi Ramamoorthi