Sciweavers

206 search results - page 16 / 42
» A nonblocking set optimized for querying the minimum value
Sort
View
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
14 years 9 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
MFCS
2004
Springer
14 years 1 months ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
13 years 2 months ago
Dispatch then stop: Optimal dissemination of security patches in mobile wireless networks
The security threat posed by malware in mobile wireless networks can be countered through immunization using security patches. The distribution of patches however consumes bandwidt...
M. H. R. Khouzani, Saswati Sarkar, Eitan Altman
DAC
1995
ACM
13 years 11 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
JACM
2008
91views more  JACM 2008»
13 years 7 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