Sciweavers

2087 search results - page 70 / 418
» Computation of class numbers of quadratic number fields
Sort
View
TSP
2010
14 years 6 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
APWEB
2010
Springer
15 years 3 months ago
Computing Large Skylines over Few Dimensions: The Curse of Anti-correlation
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
Henning Köhler, Jing Yang
JALC
2007
90views more  JALC 2007»
14 years 11 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
TPDS
2008
117views more  TPDS 2008»
14 years 11 months ago
Energy-Efficient Thermal-Aware Task Scheduling for Homogeneous High-Performance Computing Data Centers: A Cyber-Physical Approac
High Performance Computing data centers have been rapidly growing, both in number and size. Thermal management of data centers can address dominant problems associated with cooling...
Qinghui Tang, Sandeep K. S. Gupta, Georgios Varsam...
CGF
2008
111views more  CGF 2008»
15 years 6 hour ago
An Analysis of the In-Out BRDF Factorization for View-Dependent Relighting
Interactive rendering with dynamic natural lighting and changing view is a long-standing goal in computer graphics. Recently, precomputation-based methods for all-frequency religh...
Dhruv Mahajan, Yu-Ting Tseng, Ravi Ramamoorthi