Sciweavers

4066 search results - page 208 / 814
» Almost Complete Sets
Sort
View
JLP
2010
85views more  JLP 2010»
15 years 1 months ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu
ICALP
2010
Springer
15 years 11 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
15 years 10 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
VLDB
1995
ACM
89views Database» more  VLDB 1995»
15 years 10 months ago
OODB Bulk Loading Revisited: The Partitioned-List Approach
Object-oriented and object-relational databases(OODB) need to be able to load the vast quantities of data that OODB users bring to them. Loading OODB datais significantly more com...
Janet L. Wiener, Jeffrey F. Naughton
IVS
2007
110views more  IVS 2007»
15 years 6 months ago
An automated approach for the optimization of pixel-based visualizations
During the last two decades, a wide variety of advanced methods for the visual exploration of large data sets have been proposed. For most of these techniques user interaction has...
Jörn Schneidewind, Mike Sips, Daniel A. Keim