2229 search results - page 167 / 446 » The Case for Grounding Databases |
191
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
173
click to vote
DATESO
2010
15 years 4 months ago
2010
This paper presents a simple modification of classic Kohonen network (SOM), which allows parallel processing of input data vectors or partitioning the problem in case of insufficie...
174
click to vote
DATESO
2009
15 years 4 months ago
2009
Abstract. The searching for the shortest path in public transport networks can take more time than is acceptable for given situation. We have therefore searched for methods that sp...
170
click to vote
ICCD
2007
IEEE
16 years 3 months ago
2007
IEEE
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
162
click to vote
WINE
2009
Springer
16 years 1 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...