Sciweavers

2899 search results - page 425 / 580
» Dynamic Trees in Practice
Sort
View
ISIPTA
1999
IEEE
139views Mathematics» more  ISIPTA 1999»
14 years 2 months ago
Rational Decision Making With Imprecise Probabilities
Decision criteria based on an imprecise probability representation of uncertainty have been criticized, from the normative point of view, on the grounds that they make the decisio...
Jean-Yves Jaffray
VLDB
1999
ACM
131views Database» more  VLDB 1999»
14 years 2 months ago
High-Performance Extensible Indexing
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
Marcel Kornacker
DAC
1997
ACM
14 years 2 months ago
Wire Segmenting for Improved Buffer Insertion
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions propose...
Charles J. Alpert, Anirudh Devgan
SIGCSE
1997
ACM
121views Education» more  SIGCSE 1997»
14 years 2 months ago
Application-based modules using apprentice learning for CS 2
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
Owen L. Astrachan, Robert F. Smith, James T. Wilke...
SIGOPSE
1992
ACM
14 years 2 months ago
Names should mean what, not where
Abstract-- This paper describes the design and implementation1 of IRIS: an intentional resource indicator service. IRIS springs from the concept that end-users should not be bogged...
James O'Toole, David K. Gifford