#### Filter Results:

- Full text PDF available (189)

#### Publication Year

1984

2017

- This year (10)
- Last 5 years (64)
- Last 10 years (108)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Amit Goyal, Francesco Bonchi, Laks V. S. Lakshmanan
- WSDM
- 2010

Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a social graph with edges labeled with probabilities of influence between users. However, the question of where these probabilities come from or how they can be computed from realā¦ (More)

- H. V. Jagadish, Shurug Al-Khalifa, +8 authors Cong Yu
- The VLDB Journal
- 2002

This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based upon a bulk algebra for manipulating trees, and natively stores XML. New access methods have been developed to evaluate queries in the XML context, and new cost estimation and queryā¦ (More)

- Sihem Amer-Yahia, SungRan Cho, Laks V. S. Lakshmanan, Divesh Srivastava
- SIGMOD Conference
- 2001

Tree patterns forms a natural basis to query tree-structured data such as XML and LDAP. Since the efficiency of tree pattern matching against a tree-structured database depends on the size of the pattern, it is essential to identify and eliminate redundant nodes in the pattern and do so as quickly as possible. In this paper, we study tree patternā¦ (More)

- Laks V. S. Lakshmanan, Nicola Leone, Robert B. Ross, V. S. Subrahmanian
- ACM Trans. Database Syst.
- 1997

Probability theory is mathematically the best understood paradigm for modeling and manipulating uncertain information. Probabilities of complex events can be computed from those of basic events on which they depend, using any of a number of strategies. Which strategy is appropriate depends very much on the known interdependencies among the eventsā¦ (More)

- Amit Goyal, Francesco Bonchi, Laks V. S. Lakshmanan
- PVLDB
- 2011

Influence maximization is the problem of finding a set of users in a social network, such that by targeting this set, one maximizes the expected spread of influence in the network. Most of the literature on this topic has focused exclusively on the social graph, overlooking historical data, i.e., traces of past action propagations. In this paper, we studyā¦ (More)

- Amit Goyal, Wei Lu, Laks V. S. Lakshmanan
- 2011 IEEE 11th International Conference on Dataā¦
- 2011

There is significant current interest in the problem of influence maximization: given a directed social network with influence weights on edges and a number k, find k seed nodes such that activating them leads to the maximum expected number of activated nodes, according to a propagation model. Kempe et al. showed, among other things, that under the Linearā¦ (More)

- Amit Goyal, Wei Lu, Laks V. S. Lakshmanan
- WWW
- 2011

Kempe et al. [4] (KKT) showed the problem of influence maximization is <b>NP</b>-hard and a simple greedy algorithm guarantees the best possible approximation factor in PTIME. However, it has two major sources of inefficiency. First, finding the expected spread of a node set is #<b>P</b>-hard. Second, the basic greedy algorithm is quadratic in the number ofā¦ (More)

- Solmaz Kolahi, Laks V. S. Lakshmanan
- ICDT
- 2009

We study the problem of repairing an inconsistent database that violates a set of functional dependencies by making the smallest possible value modifications. For an inconsistent database, we define an optimum repair as a database that satisfies the functional dependencies, and minimizes, among all repairs, a distance measure that depends on the number ofā¦ (More)

- Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank Pandit
- SIGMOD Conference
- 2004

Querying XML data is a well-explored topic with powerful database-style query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for querying XML documents is full-text search on textual content. In this paper, we study fundamental challenges that arise when we try to integrate these two querying paradigms.Whileā¦ (More)