Sciweavers

1951 search results - page 84 / 391
» An algorithm for improving graph partitions
Sort
View
138
Voted
PVLDB
2010
147views more  PVLDB 2010»
15 years 2 months ago
HYRISE - A Main Memory Hybrid Storage Engine
In this paper, we describe a main memory hybrid database system called HYRISE, which automatically partitions tables into vertical partitions of varying widths depending on how th...
Martin Grund, Jens Krüger, Hasso Plattner, Al...
AIEDAM
2007
90views more  AIEDAM 2007»
15 years 4 months ago
Assembly synthesis with subassembly partitioning for optimal in-process dimensional adjustability
Achieving the dimensional integrity for a complex structural assembly is a demanding task due to the manufacturing variations of parts and the tolerance relationship between them....
Byungwoo Lee, Kazuhiro Saitou
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 2 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
ICIP
2005
IEEE
16 years 5 months ago
Visual tracking using sequential importance sampling with a state partition technique
Sequential importance sampling (SIS), also known as particle filtering, has drawn increasing attention recently due to its superior performance in nonlinear and non-Gaussian dynam...
Yan Zhai, Mark B. Yeary, Joseph P. Havlicek, Jean-...
DAC
2001
ACM
16 years 5 months ago
Factoring and Recognition of Read-Once Functions using Cographs and Normality
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
Martin Charles Golumbic, Aviad Mintz, Udi Rotics