Sciweavers

718 search results - page 128 / 144
» Coloring quasi-line graphs
Sort
View
FOCS
2007
IEEE
16 years 15 days ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
JCSS
2000
121views more  JCSS 2000»
15 years 6 months ago
The Closure of Monadic NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
Miklós Ajtai, Ronald Fagin, Larry J. Stockm...
CVPR
2007
IEEE
16 years 8 months ago
Topology matching for 3D video compression
This paper presents a new technique to reduce the storage cost of high quality 3D video. In 3D video [12], a sequence of 3D objects represents scenes in motion. Every frame is com...
Tony Tung, Francis Schmitt, Takashi Matsuyama
IWPEC
2009
Springer
16 years 21 days ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
PCM
2005
Springer
119views Multimedia» more  PCM 2005»
15 years 11 months ago
Haptic Interaction with Depth Video Media
Abstract. In this paper we propose a touch enabled video player system. A conventional video player only allows viewers to passively experience visual and audio media. In virtual e...
Jongeun Cha, Seung Man Kim, Ian Oakley, Jeha Ryu, ...