Sciweavers

3244 search results - page 610 / 649
» On convex complexity measures
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
14 years 2 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
14 years 2 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
IGIS
1994
118views GIS» more  IGIS 1994»
14 years 2 months ago
Surface Modelling with Guaranteed Consistency - An Object-Based Approach
There have been many interpolation methods developed over the years, each with their own problems. One of the biggest limitations in many applications is the non-correspondence of...
Christopher M. Gold, Thomas Roos
SIGGRAPH
1994
ACM
14 years 2 months ago
Generalization of Lambert's reflectance model
Lambert's model for body reflection is widely used in computer graphics. It is used extensively by rendering techniques such as radiosity and ray tracing. For several real-wo...
Michael Oren, Shree K. Nayar
SP
1989
IEEE
14 years 1 months ago
Security Issues in Policy Routing
Routing mechanisms for inter-autonomousregion communication require distribution of policy-sensitive information as well as algorithms that operate on such information. Without su...
Deborah Estrin, Gene Tsudik