Sciweavers

272 search results - page 48 / 55
» Minimal Function Graphs are not Instrumented
Sort
View
FSTTCS
1993
Springer
13 years 11 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
ICLP
2010
Springer
13 years 11 months ago
Using Generalized Annotated Programs to Solve Social Network Optimization Problems
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
Paulo Shakarian, V. S. Subrahmanian, Maria Luisa S...
ASAP
2004
IEEE
119views Hardware» more  ASAP 2004»
13 years 11 months ago
Automatic Synthesis of Customized Local Memories for Multicluster Application Accelerators
Distributed local memories, or scratchpads, have been shown to effectively reduce cost and power consumption of application-specific accelerators while maintaining performance. Th...
Manjunath Kudlur, Kevin Fan, Michael L. Chu, Scott...
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
13 years 9 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
PST
2008
13 years 8 months ago
An Access Control Scheme for Protecting Personal Data
This paper presents a new personal data access control (PDAC) scheme that is inspired by the protection schemes practiced in communities for sharing valuable commodities. The PDAC...
Wilfred Villegas, Bader Ali, Muthucumaru Maheswara...