Sciweavers

1920 search results - page 203 / 384
» The Complexity of the A B C Problem
Sort
View
CORR
2012
Springer
222views Education» more  CORR 2012»
14 years 2 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
ECIS
2000
15 years 7 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...
SAC
2004
ACM
15 years 12 months ago
A cost-oriented approach for infrastructural design
The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of fre...
Danilo Ardagna, Chiara Francalanci, Marco Trubian
INFOCOM
2011
IEEE
14 years 10 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
DAC
2006
ACM
16 years 7 months ago
Optimal cell flipping in placement and floorplanning
In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solv...
Chiu-Wing Sham, Evangeline F. Y. Young, Chris C. N...