Sciweavers

836 search results - page 150 / 168
» Orthogonal Colorings of Graphs
Sort
View
JCSS
2000
121views more  JCSS 2000»
14 years 11 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 1 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
15 years 6 months 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 5 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, ...
DIALM
2007
ACM
110views Algorithms» more  DIALM 2007»
15 years 3 months ago
SDP-based Approach for Channel Assignment in Multi-radio Wireless Networks
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
Hieu Dinh, Yoo Ah Kim, Seungjoon Lee, Minho Shin, ...