Sciweavers

3072 search results - page 398 / 615
» Shape analysis algorithm based on information theory
Sort
View
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
16 years 7 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
INFOCOM
2003
IEEE
15 years 11 months ago
Robust Location Detection in Emergency Sensor Networks
— We propose a new framework for providing robust location detection in emergency response systems, based on the theory of identifying codes. The key idea of this approach is to ...
Saikat Ray, Rachanee Ungrangsi, Francesco De Pelle...
TSP
2008
166views more  TSP 2008»
15 years 6 months ago
Nonuniform Sampling of Periodic Bandlimited Signals
Abstract--Digital processing techniques are based on representing a continuous-time signal by a discrete set of samples. This paper treats the problem of reconstructing a periodic ...
E. Margolis, Yonina C. Eldar
POPL
2006
ACM
16 years 6 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam