Sciweavers

1891 search results - page 11 / 379
» Very Large Databases: How Large, How Different
Sort
View
DEXAW
2000
IEEE
185views Database» more  DEXAW 2000»
14 years 1 months ago
The Aquarium: A Novel User Interface Metaphor for Large, Online Stores
The advent of the Web has brought an unprecedented amount of information together with a large, diverse set of users. Online users are performing a wider variety of tasks than eve...
Doug Bryan, Anatole Gershman
DISOPT
2008
85views more  DISOPT 2008»
13 years 8 months ago
How tight is the corner relaxation?
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
Matteo Fischetti, Michele Monaci
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 9 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
IWPSE
2005
IEEE
14 years 2 months ago
How Developers Drive Software Evolution
As systems evolve their structure change in ways not expected upfront. As time goes by, the knowledge of the developers becomes more and more critical for the process of understan...
Tudor Gîrba, Adrian Kuhn, Mauricio Seeberger...
PVLDB
2010
159views more  PVLDB 2010»
13 years 7 months ago
Explore or Exploit? Effective Strategies for Disambiguating Large Databases
Data ambiguity is inherent in applications such as data integration, location-based services, and sensor monitoring. In many situations, it is possible to “clean”, or remove, ...
Reynold Cheng, Eric Lo, Xuan Yang, Ming-Hay Luk, X...