Sciweavers

281 search results - page 43 / 57
» The Complexity of Planar Counting Problems
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Pseudo Likelihood Estimation in Network Tomography
Abstract— Network monitoring and diagnosis are key to improving network performance. The difficulties of performance monitoring lie in today’s fast growing Internet, accompani...
Gang Liang, Bin Yu
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 11 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
ICCAD
1997
IEEE
99views Hardware» more  ICCAD 1997»
13 years 12 months ago
High-level area and power estimation for VLSI circuits
High-level power estimation, when given only a high-level design specification such as a functional or RTL description, requires high-level estimation of the circuit average acti...
Mahadevamurty Nemani, Farid N. Najm
IWPEC
2009
Springer
14 years 2 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...
ICCV
2011
IEEE
12 years 7 months ago
2D-3D Fusion for Layer Decomposition of Urban Facades
We present a method for fusing two acquisition modes, 2D photographs and 3D LiDAR scans, for depth-layer decomposition of urban facades. The two modes have complementary character...
Yangyan Li, Qian Zheng, Andrei Sharf, Daniel Cohen...