Sciweavers

3946 search results - page 329 / 790
» The computational complexity of choice sets
Sort
View
MOR
2006
95views more  MOR 2006»
15 years 6 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
VLDB
2005
ACM
86views Database» more  VLDB 2005»
16 years 9 days ago
One-Pass Wavelet Synopses for Maximum-Error Metrics
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
Panagiotis Karras, Nikos Mamoulis
CMG
2000
15 years 8 months ago
Comparing CPU Performance Between and Within Processor Families
Our study compares CPU performance on RISC and CISC uni and multiprocessors of varying speeds, and shows that the Instruction Set Architecture (ISA) style no longer matters. Our s...
Lee A. Butler, Travis Atkison, Ethan L. Miller
202
Voted
AI
2005
Springer
15 years 6 months ago
On the consistency of cardinal direction constraints
We present a formal model for qualitative spatial reasoning with cardinal directions utilizing a co-ordinate system. Then, we study the problem of checking the consistency of a se...
Spiros Skiadopoulos, Manolis Koubarakis
FOCS
2005
IEEE
16 years 13 days ago
Beyond VCG: Frugality of Truthful Mechanisms
We study truthful mechanisms for auctions in which the auctioneer is trying to hire a team of agents to perform a complex task, and paying them for their work. As common in the ï¬...
Anna R. Karlin, David Kempe, Tami Tamir