Sciweavers

9719 search results - page 1796 / 1944
» Answer Set Optimization
Sort
View
VLDB
2001
ACM
66views Database» more  VLDB 2001»
15 years 5 months ago
An Evaluation of Generic Bulk Loading Techniques
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
Jochen Van den Bercken, Bernhard Seeger
VLDB
2001
ACM
94views Database» more  VLDB 2001»
15 years 5 months ago
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
Ilaria Bartolini, Paolo Ciaccia, Florian Waas
DSN
2000
IEEE
15 years 5 months ago
On the Quality of Service of Failure Detectors
ÐWe study the quality of service (QoS) of failure detectors. By QoS, we mean a specification that quantifies 1) how fast the failure detector detects actual failures and 2) how we...
Wei Chen, Sam Toueg, Marcos Kawazoe Aguilera
HPDC
2000
IEEE
15 years 5 months ago
dQUOB: Managing Large Data Flows using Dynamic Embedded Queries
The dQUOB system satis es client need for speci c information from high-volume data streams. The data streams we speak of are the ow of data existing during large-scale visualizat...
Beth Plale, Karsten Schwan
SPAA
1999
ACM
15 years 5 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
« Prev « First page 1796 / 1944 Last » Next »