Sciweavers

989 search results - page 110 / 198
» Version spaces and the consistency problem
Sort
View
CPAIOR
2006
Springer
15 years 8 months ago
Conflict-Directed A* Search for Soft Constraints
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
Martin Sachenbacher, Brian C. Williams
SPIRE
2010
Springer
15 years 4 months ago
String Matching with Variable Length Gaps
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
Philip Bille, Inge Li Gørtz, Hjalte Wedel V...
BMCBI
2008
148views more  BMCBI 2008»
15 years 6 months ago
Discovering biclusters in gene expression data based on high-dimensional linear geometries
Background: In DNA microarray experiments, discovering groups of genes that share similar transcriptional characteristics is instrumental in functional annotation, tissue classifi...
Xiangchao Gan, Alan Wee-Chung Liew, Hong Yan
SIGMOD
2005
ACM
153views Database» more  SIGMOD 2005»
16 years 6 months ago
Multiple Aggregations Over Data Streams
Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. The need for exploratory IP traffic data analysis naturally leads ...
Rui Zhang 0003, Nick Koudas, Beng Chin Ooi, Divesh...
CPAIOR
2007
Springer
16 years 4 days ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...