Sciweavers

1429 search results - page 191 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
ECIS
2000
13 years 9 months ago
What's in a Name? Conceptual Issues in Defining Electronic Commerce
Definitions of electronic commerce are many and varied. They indicate a lack of consensus about what electronic commerce is. `A `definition' implies a direct and unproblematic...
Linda Wilkins, Paula M. C. Swatman, Tanya Castlema...
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
13 years 7 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng
TOG
2008
102views more  TOG 2008»
13 years 7 months ago
A meshless hierarchical representation for light transport
We introduce a meshless hierarchical representation for solving light transport problems. Precomputed radiance transfer (PRT) and finite elements require a discrete representation...
Jaakko Lehtinen, Matthias Zwicker, Emmanuel Turqui...
JAIR
2002
101views more  JAIR 2002»
13 years 7 months ago
Structured Knowledge Representation for Image Retrieval
We propose a structured approach to the problem of retrieval of images by content and present a description logic that has been devised for the semantic indexing and retrieval of ...
Eugenio Di Sciascio, Francesco M. Donini, Marina M...
TCAD
1998
115views more  TCAD 1998»
13 years 7 months ago
Probabilistic modeling of dependencies during switching activity analysis
—This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretica...
Radu Marculescu, Diana Marculescu, Massoud Pedram