Sciweavers

115 search results - page 8 / 23
» Generating All Sets With Bounded Unions
Sort
View
JAR
2011
112views more  JAR 2011»
13 years 2 months ago
A Framework for Certified Boolean Branch-and-Bound Optimization
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...
VLDB
2007
ACM
130views Database» more  VLDB 2007»
14 years 7 months ago
A Simple and Efficient Estimation Method for Stream Expression Cardinalities
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
Aiyou Chen, Jin Cao, Tian Bu
JSAC
2000
134views more  JSAC 2000»
13 years 7 months ago
Adaptive multidimensional coded modulation over flat fading channels
We introduce a general adaptive coding scheme for Nakagami multipath fading channels. An instance of the coding scheme utilizes a set of 2 -dimensional (2 -D) trellis codes origina...
Kjell Jørgen Hole, Henrik Holm, Geir E. &Os...
CPAIOR
2007
Springer
14 years 1 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
IS
2008
13 years 7 months ago
Integration of complex archeology digital libraries: An ETANA-DL experience
In this paper, we formalize the digital library (DL) integration problem and propose an overall approach based on the 5S (streams, structures, spaces, scenarios, and societies) fr...
Rao Shen, Naga Srinivas Vemuri, Weiguo Fan, Edward...