Sciweavers

1081 search results - page 12 / 217
» Working with the LR Degrees
Sort
View
ICSE
2005
IEEE-ACM
14 years 9 months ago
A B.S. degree in informatics: contextualizing software engineering education
Software engineering (SE) is very different in focus from traditional computer science: it is not just about computers and software, but as much about the context in which they ar...
André van der Hoek, David G. Kay, Debra J. ...
ICC
2009
IEEE
232views Communications» more  ICC 2009»
14 years 4 months ago
Degrees of Freedom and Sum Rate Maximization for Two Mutually Interfering Broadcast Channels
— In this paper, we derive a precise expression of spatial degrees of freedom (DOF) for two mutually interfering broadcast channels (IFBC) as a function of arbitrary numbers of t...
Seokhwan Park, Inkyu Lee
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
14 years 4 months ago
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
Per Austrin, Subhash Khot, Muli Safra
ICASSP
2007
IEEE
14 years 4 months ago
All-Clear Image Based Synthesis using Clarity Degree
Image based rendering (IBR) usually produces severe artifacts, typically blur and ghost, for objects not located on the focal plane. To obtain an all clear result, previous works ...
Xun Cao, Su Xue, Qionghai Dai
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
14 years 3 months ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman