16666 search results - page 3129 / 3334 » Descriptive and Computational Complexity |
165
click to vote
SIGMOD
2010
ACM
15 years 10 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
120
click to vote
CSR
2010
Springer
15 years 10 months ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
189
click to vote
EDCC
2010
Springer
15 years 10 months ago
2010
Springer
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
160
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
Within nature, the success of many organisms, including certain species of insects, mammals, slime molds, and bacteria, is attributed to their performance of division of labor, wh...
283
click to vote
MHCI
2009
Springer
15 years 9 months ago
2009
Springer
Touch-sensitive displays seem like a natural and promising option for dealing with the increasing complexity of current in-vehicle information systems (IVIS), but since they can h...