Sciweavers

123 search results - page 20 / 25
» Enumerating Triangulation Paths
Sort
View
DAC
2010
ACM
14 years 10 days ago
Lattice-based computation of Boolean functions
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
Mustafa Altun, Marc D. Riedel
ASPDAC
2001
ACM
105views Hardware» more  ASPDAC 2001»
14 years 2 days ago
Toward better wireload models in the presence of obstacles
Wirelength estimation techniques typically contain a site density function that enumerates all possible path sites for each wirelength in an architecture and an occupation probabil...
Chung-Kuan Cheng, Andrew B. Kahng, Bao Liu, Dirk S...
CHI
2011
ACM
13 years 16 hour ago
Feedlack detects missing feedback in web applications
While usability methods such as user studies and inspections can reveal a wide range of problems, they do so for only a subset of an application’s features and states. We presen...
Andrew J. Ko, Xing Zhang
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 8 months ago
Termination Detection of Local Computations
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...
Emmanuel Godard, Yves Métivier, Gerard Tel
FSTTCS
2004
Springer
14 years 1 months ago
Short-Cuts on Star, Source and Planar Unfoldings
When studying a 3D polyhedron, it is often easier to cut it open and atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...
Vijay Chandru, Ramesh Hariharan, Narasimha M. Kris...