Sciweavers

1802 search results - page 168 / 361
» Complexity Theory for Operators in Analysis
Sort
View
DESRIST
2009
Springer
115views Education» more  DESRIST 2009»
15 years 9 months ago
Ontological design
In this paper, we describe the concept of ontological design. We show how ontologies can be used as cognitive maps of complex, ill-structured, plastic problems. They can be used t...
Arkalgud Ramaprasad, Sridhar S. Papagari
DIALM
2008
ACM
168views Algorithms» more  DIALM 2008»
15 years 8 months ago
Local broadcasting in the physical interference model
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...
AAAI
1990
15 years 7 months ago
Approximation Reformulations
Although computers are widely used to simulate complex physical systems, crafting the underlying models that enable computer analysis remains difficult. When a model is created fo...
Daniel S. Weld
COMPGEOM
2011
ACM
14 years 10 months ago
Compressive sensing with local geometric features
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachli...
VMCAI
2004
Springer
15 years 11 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard