Sciweavers

601 search results - page 113 / 121
» Quantified Equality Constraints
Sort
View
FOCS
2008
IEEE
15 years 10 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ICC
2008
IEEE
139views Communications» more  ICC 2008»
15 years 10 months ago
Communications and Sensing of Illumination Contributions in a Power LED Lighting System
— In recent years, LED technology emerged as a prime candidate for the future illumination light source, due to high energy efficiency and long life time. In addition, LEDs offe...
Jean-Paul M. G. Linnartz, Lorenzo Feri, Hongming Y...
PG
2007
IEEE
15 years 10 months ago
Genus Oblivious Cross Parameterization: Robust Topological Management of Inter-Surface Maps
We consider the problem of generating a map between two triangulated meshes, M and M’, with arbitrary and possibly differing genus. This problem has rarely been tackled in its g...
Janine Bennett, Valerio Pascucci, Kenneth I. Joy
139
Voted
EDOC
2006
IEEE
15 years 10 months ago
Service Interaction Modeling: Bridging Global and Local Views
In a Service-Oriented Architecture (SOA), a system is viewed as a collection of independent units (services) that interact with one another through message exchanges. Established ...
Johannes Maria Zaha, Marlon Dumas, Arthur H. M. te...
RTAS
2005
IEEE
15 years 9 months ago
Timing Analysis for Sensor Network Nodes of the Atmega Processor Family
Low-end embedded architectures, such as sensor nodes, have become popular in diverse fields, many of which impose real-time constraints. Currently, the Atmel Atmega processor fam...
Sibin Mohan, Frank Mueller, David B. Whalley, Chri...