Sciweavers

915 search results - page 128 / 183
» Maximally Abstract Retrenchments
Sort
View
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 2 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
IDA
2007
Springer
14 years 2 months ago
Compact and Understandable Descriptions of Mixtures of Bernoulli Distributions
Abstract. Finite mixture models can be used in estimating complex, unknown probability distributions and also in clustering data. The parameters of the models form a complex repres...
Jaakko Hollmén, Jarkko Tikka
ISICA
2007
Springer
14 years 2 months ago
Interplanetary Trajectory Optimization with Swing-Bys Using Evolutionary Multi-objective Optimization
Abstract. Interplanetary trajectory optimization studies mostly considered a single objective of minimizing travel time between two planets or launch velocity of spacecraft at the ...
Kalyanmoy Deb, Nikhil Padhye, Ganesh Neema
ISVC
2007
Springer
14 years 2 months ago
Unsynchronized 4D Barcodes
Abstract. We present a novel technique for optical data transfer between public displays and mobile devices based on unsynchronized 4D barcodes. We assume that no direct (electroma...
Tobias Langlotz, Oliver Bimber
LFCS
2007
Springer
14 years 2 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang