Sciweavers

844 search results - page 65 / 169
» Further results on concordance relations
Sort
View
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
15 years 11 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
VLDB
2005
ACM
115views Database» more  VLDB 2005»
15 years 4 months ago
KLEE: A Framework for Distributed Top-k Query Algorithms
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
Sebastian Michel, Peter Triantafillou, Gerhard Wei...
SIGMOD
2010
ACM
259views Database» more  SIGMOD 2010»
15 years 4 months ago
PODS: a new model and processing algorithms for uncertain data streams
Uncertain data streams, where data is incomplete, imprecise, and even misleading, have been observed in many environments. Feeding such data streams to existing stream systems pro...
Thanh T. L. Tran, Liping Peng, Boduo Li, Yanlei Di...
LPNMR
1993
Springer
15 years 3 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
GLOBECOM
2009
IEEE
15 years 3 months ago
Exploring Simulated Annealing and Graphical Models for Optimization in Cognitive Wireless Networks
In this paper we discuss the design of optimization algorithms for cognitive wireless networks (CWNs). Maximizing the perceived network performance towards applications by selectin...
Elena Meshkova, Janne Riihijärvi, Andreas Ach...