Sciweavers

1047 search results - page 197 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
ICDE
2010
IEEE
189views Database» more  ICDE 2010»
13 years 7 months ago
Caching all plans with just one optimizer call
Abstract— Modern database management systems (DBMS) answer a multitude of complex queries on increasingly larger datasets. Given the complexities of the queries and the numerous ...
Debabrata Dash, Ioannis Alagiannis, Cristina Maier...
AUTONOMICS
2008
ACM
13 years 9 months ago
MWM: a map-based world model for wireless sensor networks
A prominent functionality of a Wireless Sensor Network (WSN) is environmental monitoring. For this purpose the WSN creates a model for the real world by using abstractions to pars...
Abdelmajid Khelil, Faisal Karim Shaikh, Brahim Aya...
ASIACRYPT
2010
Springer
13 years 5 months ago
A Closer Look at Anonymity and Robustness in Encryption Schemes
Abstract. In this work, we take a closer look at anonymity and robustness in encryption schemes. Roughly speaking, an anonymous encryption scheme hides the identity of the secret-k...
Payman Mohassel
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 11 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
WEBI
2010
Springer
13 years 5 months ago
Lightweight Clustering Methods for Webspam Demotion
Abstract--To make sure they can quickly respond to a specific query, the main search engines have several mechanisms. One of them consists in ranking web pages according to their i...
Thomas Largillier, Sylvain Peyronnet