2925 search results - page 349 / 585 » Information Complexity of Online Problems |
NOMS
2002
IEEE
15 years 9 months ago
2002
IEEE
As web services become more prevalent, the nature of electronic transactions on the Internet changes from simple browser-to-business clicks to an orchestrated flow of messages bet...
IDA
1997
Springer
15 years 8 months ago
1997
Springer
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
154
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
176
click to vote
INFOSCALE
2007
ACM
15 years 6 months ago
2007
ACM
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...
154
click to vote
JSS
2010
14 years 11 months ago
2010
Managing the architectural description (AD) of a complex software system and maintaining consistency among the different models is a demanding task. To understand the underlying p...