Sciweavers

5158 search results - page 665 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
PPDP
2007
Springer
16 years 29 days ago
Formalizing and verifying semantic type soundness of a simple compiler
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Nick Benton, Uri Zarfaty
RSKT
2007
Springer
16 years 29 days ago
ROSA: An Algebra for Rough Spatial Objects in Databases
Abstract. A fundamental data modeling problem in geographical information systems and spatial database systems refers to an appropriate treatment of the vagueness or indeterminacy ...
Markus Schneider, Alejandro Pauly
STACS
2007
Springer
16 years 29 days ago
The Polynomially Bounded Perfect Matching Problem Is in NC 2
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierau...
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
16 years 29 days ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
FOCS
2006
IEEE
16 years 27 days ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau