Sciweavers

1565 search results - page 9 / 313
» An unlikely result
Sort
View
LPNMR
2005
Springer
15 years 5 months ago
Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
Lengning Liu, Miroslaw Truszczynski
CASC
2007
Springer
112views Mathematics» more  CASC 2007»
15 years 3 months ago
An Efficient LLL Gram Using Buffered Transformations
In this paper we introduce an improved variant of the LLL algorithm. Using the Gram matrix to avoid expensive correction steps necessary in the Schnorr-Euchner algorithm and introd...
Werner Backes, Susanne Wetzel
VLDB
2000
ACM
151views Database» more  VLDB 2000»
15 years 3 months ago
The TreeScape System: Reuse of Pre-Computed Aggregates over Irregular OLAP Hierarchies
We present the TreeScape system that, unlike any other system known to the authors, enables the reuse of pre-computed aggregate query results for irregular dimension hierarchies, ...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
98
Voted
ICML
2008
IEEE
16 years 17 days ago
Predicting diverse subsets using structural SVMs
In many retrieval tasks, one important goal involves retrieving a diverse set of results (e.g., documents covering a wide range of topics for a search query). First of all, this r...
Yisong Yue, Thorsten Joachims
STOC
2006
ACM
112views Algorithms» more  STOC 2006»
16 years 2 days ago
A quasi-PTAS for unsplittable flow on line graphs
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Bar...