1027 search results - page 159 / 206 » Progress on the Progressive Party Problem |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
159
click to vote
VLDB
2008
ACM
15 years 10 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
ESWS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Ontology matching has become an important field of research over the last years. Although many different approaches have been proposed, only few of them are committed t...
ASPDAC
2005
ACM
15 years 3 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...