2080 search results - page 280 / 416 » Measuring empirical computational complexity |
189
click to vote
LICS
2006
IEEE
16 years 12 days ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
164
click to vote
TRIDENTCOM
2006
IEEE
16 years 11 days ago
2006
IEEE
— This work presents an UWB testbed for reduced data rates with capabilities of measuring range and location. The transmitter uses Time Hopping spread spectrum codes to reduce th...
155
click to vote
SMA
2005
ACM
15 years 12 months ago
2005
ACM
For simulations involving complex objects, a number of different properties must be represented. An example of this is in modeling an object undergoing combustion—heat amounts,...
160
click to vote
DIS
2005
Springer
15 years 12 months ago
2005
Springer
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
168
click to vote
DAWAK
2003
Springer
15 years 11 months ago
2003
Springer
View materialization is recognized to be one of the most effective ways to increase the Data Warehouse performance; nevertheless, due to the computational complexity of the techniq...