|
ROLE
BOOKMARK & SHARE
|
|
Result page:
1
2
3
4
5
6
7
8
9
1
March 2013
For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are ...
2
April 2012
Transactions on Data Privacy: Volume 5 Issue 1, April 2012
Publisher: IIIA-CSIC
The advent of database services has resulted in privacy concerns on the part of the client storing data with third party database service providers. Previous approaches to enabling such a service have been based on data encryption, causing a large overhead in query processing. A distributed architecture for secure database ...
3
March 2011
PAIS '11: Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1, Downloads (12 Months): 9, Downloads (Overall): 256
Full text available:
 PDF
The advent of database services has resulted in privacy concerns on the part of the client storing data with third party database service providers. Previous approaches to enabling such a service have been based on data encryption, causing a large overhead in query processing. A distributed architecture for secure database ...
4
April 2010
Discrete Applied Mathematics: Volume 158 Issue 8, April, 2010
Publisher: Elsevier Science Publishers B. V.
We show how to find in Hamiltonian graphs a cycle of length n^@W^(^1^/^l^o^g^l^o^g^n^)=exp(@W(logn/loglogn)). This is a consequence of a more general result in which we show that if G has a maximum degree d and has a cycle with k vertices (or a 3-cyclable minor H with k vertices), then ...
Keywords:
3-cyclable graph, Planar graph, 3-connected graph, Hamiltonian cycle, Long cycle in graphs
5
February 2010
Algorithms and theory of computation handbook: general concepts and techniques
Publisher: Chapman & Hall/CRC
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 28, Downloads (12 Months): 329, Downloads (Overall): 1,546
Full text available:
Pdf
6
January 2010
SODA '10: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1, Downloads (12 Months): 7, Downloads (Overall): 110
Full text available:
PDF
A classic theorem by Vizing proves that if the maximum degree of a graph is Δ then it is possible to color its edges, in polynomial time, using at most Δ+1 colors. However, this algorithm is offline, i.e., it assumes the whole graph is known in advance. A natural question ...
7
December 2009
WINE '09: Proceedings of the 5th International Workshop on Internet and Network Economics
Publisher: Springer-Verlag
We study the use of viral marketing strategies on social networks that seek to maximize revenue from the sale of a single product. We propose a model in which the decision of a buyer to buy the product is influenced by friends that own the product and the price at ...
8
June 2009
Information Processing Letters: Volume 109 Issue 14, June, 2009
Publisher: Elsevier North-Holland, Inc.
Keywords:
Graph algorithms, Graph turnpike problem, Computational geometry
9
October 2008
CIKM '08: Proceedings of the 17th ACM conference on Information and knowledge management
Publisher: ACM
Bibliometrics:
Citation Count: 35
Downloads (6 Weeks): 9, Downloads (12 Months): 47, Downloads (Overall): 1,348
Full text available:
PDF
We consider a privacy threat to a social network in which the goal of an attacker is to obtain knowledge of a significant fraction of the links in the network. We formalize the typical social network interface and the information about links that it provides to its users in terms ...
Keywords:
privacy in data mining, social networks, link analysis, anonymization, link privacy
10
April 2008
ICDE '08: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Publisher: IEEE Computer Society
We study the problem of auditing a batch of SQL queries: Given a forbidden view of a database that should have been kept confidential, a batch of queries that were posed over this database and answered, and a definition of suspiciousness, determine if the query batch is suspicious with respect ...
11
April 2008
ICDE '08: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Publisher: IEEE Computer Society
We consider a privacy threat to a social network in which the goal of an attacker is to obtain knowledge of a significant fraction of the links in the network. We formalize the typical social network interface and the information about links that it provides to its users in terms ...
12
December 2007
SIAM Journal on Discrete Mathematics: Volume 21 Issue 4, January 2008
Publisher: Society for Industrial and Applied Mathematics
Given a metric space $(X,d_X)$, $c \ge 1$, $r > 0$, and $p,q \in [0,1]$, a distribution over mappings $\mathscr{H} : X \to \mathbb{N}$ is called a $(r,cr,p,q)$-sensitive hash family if any two points in $X$ at distance at most $r$ are mapped by $\mathscr{H}$ to the same value with ...
Keywords:
locality sensitive hashing, lower bounds, nearest neighbor search
13
July 2007
ICALP'07: Proceedings of the 34th international conference on Automata, Languages and Programming
Publisher: Springer-Verlag
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarantees on the estimated sum. In this paper we consider various sampling methods besides uniform sampling, in particular sampling a variable with probability ...
14
May 2007
Journal of Computer and System Sciences: Volume 73 Issue 3, May, 2007
Publisher: Academic Press, Inc.
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with short-lived hosts being the norm rather than an exception. In recent years, researchers have investigated best-effort algorithms to efficiently process aggregate queries (e.g., sum, count, average, minimum and ...
Keywords:
Sensor, Aggregate queries, Correctness criterion, Peer-to-Peer
15
April 2007
ICDEW '07: Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering Workshop
Publisher: IEEE Computer Society
In this paper, we study the problem of auditing a batch of SQL queries: given a set of SQL queries that have been posed over a database, determine whether some subset of these queries have revealed private information about an individual or group of individuals. In [2], the authors studied ...
16
April 2007
ICDEW '07: Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering Workshop
Publisher: IEEE Computer Society
Automated recommendation systems have emerged in the past decade as a useful tool to reduce the information overload faced by users at e-commerce sites. Recently Drineas et al., Kleinberg and Sandler, and others have introduced algorithms with provable performance guarantees. In this work we expand the mixture model introduced by ...
17
February 2007
ACM Transactions on Algorithms (TALG): Volume 3 Issue 1, February 2007
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2, Downloads (12 Months): 10, Downloads (Overall): 434
Full text available:
PDF
Query optimization that involves expensive predicates has received considerable attention in the database community. Typically, the output to a database query is a set of tuples that satisfy certain conditions, and, with expensive predicates, these conditions may be computationally costly to verify. In the simplest case, when the query looks ...
Keywords:
Competitive analysis, online algorithms
18
January 2007
Journal of Algorithms: Volume 62 Issue 1, January, 2007
Publisher: Academic Press, Inc.
We consider the problem of estimating the length of the shortest path from a vertex s to a vertex t in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Initially, for each edge e, the length of e is known only ...
Keywords:
Shortest path
19
December 2006
ICDMW '06: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
Publisher: IEEE Computer Society
Keyword3 generation for search engine advertising is an important problem for sponsored search or paidplacement advertising. A recent strategy in this area is bidding on nonobvious yet relevant words, which are economically more viable. Targeting many such nonobvious words lowers the advertising cost, while delivering the same click volume as ...
20
November 2006
CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge management
Publisher: ACM
Bibliometrics:
Citation Count: 23
Downloads (6 Weeks): 3, Downloads (12 Months): 10, Downloads (Overall): 445
Full text available:
PDF
We consider the problem of estimating the size of a collection of documents using only a standard query interface. Our main idea is to construct an unbiased and low-variance estimator that can closely approximate the size of any set of documents defined by certain conditions, including that each document in ...
Keywords:
corpus size, estimator, random sampling
|
|
Author only
