Sciweavers

6582 search results - page 373 / 1317
» The focus of attention problem
Sort
View
ICDE
2012
IEEE
249views Database» more  ICDE 2012»
13 years 9 months ago
Answering Why-not Questions on Top-k Queries
Abstract—After decades of effort working on database performance, the quality and the usability of database systems have received more attention in recent years. In particular, t...
Zhian He, Eric Lo
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
16 years 4 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
CC
2007
Springer
157views System Software» more  CC 2007»
16 years 1 months ago
New Algorithms for SIMD Alignment
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...
Liza Fireman, Erez Petrank, Ayal Zaks
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
16 years 24 days ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
ICLP
1999
Springer
15 years 11 months ago
Computing Large and Small Stable Models
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
Miroslaw Truszczynski