Sciweavers

1795 search results - page 245 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 6 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
PODS
2007
ACM
109views Database» more  PODS 2007»
16 years 6 months ago
What is "next" in event processing?
Event processing systems have wide applications ranging from managing events from RFID readers to monitoring RSS feeds. Consequently, there exists much work on them in the literat...
Walker M. White, Mirek Riedewald, Johannes Gehrke,...
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 3 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
CP
2007
Springer
16 years 18 days ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
COCOON
2005
Springer
15 years 12 months ago
Server Allocation Algorithms for Tiered Systems
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...
Kamalika Chaudhuri, Anshul Kothari, Rudi Pendaving...