Sciweavers

1019 search results - page 192 / 204
» Uniform Functors on Sets
Sort
View
ICDT
1999
ACM
72views Database» more  ICDT 1999»
13 years 11 months ago
On the Generation of 2-Dimensional Index Workloads
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...
Joseph M. Hellerstein, Lisa Hellerstein, George Ko...
ERCIMDL
1998
Springer
183views Education» more  ERCIMDL 1998»
13 years 11 months ago
The Alexandria Digital Library Architecture
Abstract. Since 1994, the Alexandria Digital Library Project has developed three prototype digital libraries for georeferenced information. This paper describes the most recent of ...
James Frew, Michael Freeston, Nathan Freitas, Lind...
ICNP
1997
IEEE
13 years 11 months ago
Balanced Routing
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
Jorge Arturo Cobb, Mohamed G. Gouda
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
13 years 11 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
13 years 11 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...