Sciweavers

6274 search results - page 158 / 1255
» From query complexity to computational complexity
Sort
View
DAIS
2009
15 years 2 months ago
Automated Assessment of Aggregate Query Imprecision in Dynamic Environments
Queries are widely used for acquiring data distributed in opportunistically formed mobile networks. However, when queries are executed in such dynamic settings, the returned result...
Vasanth Rajamani, Christine Julien, Jamie Payton
HAPTICS
2007
IEEE
15 years 10 months ago
Accelerated Proximity Queries for Haptic Rendering of Deformable Models
We present a fast proximity query algorithm for haptic display of complex deformable models using a layered representation. Assuming that each solid model can be represented as a ...
Nico Galoppo, Miguel A. Otaduy, Paul Mecklenburg, ...
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
15 years 9 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
EDBT
2010
ACM
177views Database» more  EDBT 2010»
15 years 11 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
JACM
2008
91views more  JACM 2008»
15 years 4 months ago
On the minimization of XPath queries
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
Sergio Flesca, Filippo Furfaro, Elio Masciari