Sciweavers

2354 search results - page 179 / 471
» Assignment Problems
Sort
View
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
15 years 4 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
JDA
2006
83views more  JDA 2006»
15 years 6 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
ICCAD
1994
IEEE
134views Hardware» more  ICCAD 1994»
15 years 10 months ago
Boolean constrained encoding: a new formulation and a case study
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
Ney Laert Vilar Calazans
EMNLP
2007
15 years 7 months ago
Using Semantic Roles to Improve Question Answering
Shallow semantic parsing, the automatic identification and labeling of sentential constituents, has recently received much attention. Our work examines whether semantic role info...
Dan Shen, Mirella Lapata
INCDM
2007
Springer
69views Data Mining» more  INCDM 2007»
16 years 12 days ago
Simultaneous Co-clustering and Modeling of Market Data
For difficult prediction problems, practitioners often segment the data into relatively homogenous groups and then build a model for each group. This two-step procedure usually res...
Meghana Deodhar, Joydeep Ghosh