Sciweavers

4498 search results - page 844 / 900
» How to Invent Functions
Sort
View
VLDB
1998
ACM
82views Database» more  VLDB 1998»
15 years 10 months ago
Resource Scheduling for Composite Multimedia Objects
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
Minos N. Garofalakis, Yannis E. Ioannidis, Banu &O...
VLDB
1998
ACM
108views Database» more  VLDB 1998»
15 years 10 months ago
MindReader: Querying Databases Through Multiple Examples
Users often can not easily express their queries. For example, in a multimedia image by content setting, the user might want photographs with sunsets; in current systems, like QBI...
Yoshiharu Ishikawa, Ravishankar Subramanya, Christ...
SIGMOD
1997
ACM
172views Database» more  SIGMOD 1997»
15 years 10 months ago
An Array-Based Algorithm for Simultaneous Multidimensional Aggregates
Computing multiple related group-bys and aggregates is one of the core operations of On-Line Analytical Processing (OLAP) applications. Recently, Gray et al. [GBLP95] proposed the...
Yihong Zhao, Prasad Deshpande, Jeffrey F. Naughton
SPAA
1997
ACM
15 years 10 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 10 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...