666 search results - page 115 / 134 » New primal-dual algorithms for Steiner tree problems |
VLSID
2005
IEEE
14 years 2 months ago
2005
IEEE
In recent years, there has been an increasing interest in Quantified Boolean Formula (QBF) evaluation, since several VLSI CAD problems can be formulated efficiently as QBF insta...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
BMCBI
2005
13 years 9 months ago
2005
Abstract. Taxonomy provides one of the most powerful ways to navigate sequence data bases but currently, users are forced to formulate queries according to a single taxonomic class...
NIPS
2004
13 years 10 months ago
2004
Semantic taxonomies such as WordNet provide a rich source of knowledge for natural language processing applications, but are expensive to build, maintain, and extend. Motivated by...
ITICSE
2009
ACM
14 years 3 months ago
2009
ACM
The topic of data structures has historically been taught with two major focuses: first, the basic definition and implementation of a small set of basic data structures (e.g. list...