Sciweavers

481 search results - page 65 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
COMBINATORICA
2007
119views more  COMBINATORICA 2007»
13 years 8 months ago
Complete partitions of graphs
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
Magnús M. Halldórsson, Guy Kortsarz,...
PODS
1995
ACM
124views Database» more  PODS 1995»
14 years 7 days ago
Window Query-Optimal Clustering of Spatial Objects
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
Bernd-Uwe Pagel, Hans-Werner Six, Mario Winter
AI
2005
Springer
13 years 8 months ago
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
Zhao Xing, Weixiong Zhang
ECCC
2010
80views more  ECCC 2010»
13 years 8 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
ICAPR
2005
Springer
14 years 2 months ago
Texture Exemplars for Defect Detection on Random Textures
We present a new approach to detecting defects in random textures which requires only very few defect free samples for unsupervised training. Each product image is divided into ove...
Xianghua Xie, Majid Mirmehdi