Sciweavers

4679 search results - page 862 / 936
» Modeling When Connections Are the Problem
Sort
View
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
15 years 11 months ago
How to Determine a Good Multi-Programming Level for External Scheduling
Scheduling/prioritization of DBMS transactions is important for many applications that rely on database backends. A convenient way to achieve scheduling is to limit the number of ...
Bianca Schroeder, Mor Harchol-Balter, Arun Iyengar...
GIS
2005
ACM
15 years 11 months ago
Supporting uncertainty in moving objects in network databases
The management of moving objects has been intensively studied in the recent years. A wide and increasing range of database applications has to deal with spatial objects whose posi...
Ralf Hartmut Güting, Victor Teixeira de Almei...
SPAA
2009
ACM
15 years 10 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
KDD
2009
ACM
269views Data Mining» more  KDD 2009»
15 years 10 months ago
Extracting discriminative concepts for domain adaptation in text mining
One common predictive modeling challenge occurs in text mining problems is that the training data and the operational (testing) data are drawn from different underlying distributi...
Bo Chen, Wai Lam, Ivor Tsang, Tak-Lam Wong
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
15 years 10 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...