Sciweavers

70 search results - page 12 / 14
» Compactness in locales and in formal topology
Sort
View
CVPR
2011
IEEE
13 years 3 months ago
Graph Embedding Discriminant Analysis on Grassmannian Manifolds for Improved Image Set Matching
A convenient way of dealing with image sets is to represent them as points on Grassmannian manifolds. While several recent studies explored the applicability of discriminant analy...
Mehrtash Harandi, Sareh, Shirazi (National ICT Aus...
SIGCOMM
2006
ACM
14 years 1 months ago
Growth codes: maximizing sensor network data persistence
Sensor networks are especially useful in catastrophic or emergency scenarios such as floods, fires, terrorist attacks or earthquakes where human participation may be too dangero...
Abhinav Kamra, Vishal Misra, Jon Feldman, Dan Rube...
CORR
2008
Springer
190views Education» more  CORR 2008»
13 years 6 months ago
Chain-Based Representations for Solid and Physical Modeling
In this paper we show that the (co)chain complex associated with a decomposition of the computational domain, commonly called a mesh in computational science and engineering, can b...
Antonio DiCarlo, Franco Milicchio, Alberto Paoluzz...
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
13 years 7 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
14 years 17 days ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena