Sciweavers

18090 search results - page 3422 / 3618
» Computing by Only Observing
Sort
View
ICALP
2009
Springer
16 years 5 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
ICALP
2009
Springer
16 years 5 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
VLDB
2003
ACM
147views Database» more  VLDB 2003»
16 years 4 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
VLDB
2004
ACM
161views Database» more  VLDB 2004»
16 years 4 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
VLDB
2006
ACM
138views Database» more  VLDB 2006»
16 years 4 months ago
Succinct representation of flexible and privacy-preserving access rights
Abstract We explore the problem of portable and flexible privacy preserving access rights that permit access to a large collection of digital goods. Privacy-preserving access contr...
Marina Blanton, Mikhail J. Atallah
« Prev « First page 3422 / 3618 Last » Next »