Sciweavers

3008 search results - page 345 / 602
» Independence in connected graphs
Sort
View
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 10 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
JCDCG
2000
Springer
15 years 10 months ago
Volume Queries in Polyhedra
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
John Iacono, Stefan Langerman
MSS
2008
IEEE
88views Hardware» more  MSS 2008»
15 years 6 months ago
Cubical token systems
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a t...
Sergei Ovchinnikov
COLING
2010
15 years 1 months ago
Towards a Unified Approach to Simultaneous Single-Document and Multi-Document Summarizations
Single-document summarization and multidocument summarization are very closely related tasks and they have been widely investigated independently. This paper examines the mutual i...
Xiaojun Wan
CORR
2010
Springer
154views Education» more  CORR 2010»
15 years 6 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...