Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,661
Maximizing the Spread of Influence Through a Social Network
- In KDD
, 2003
"... Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in game-theoretic settings, and the effects of ..."
Abstract
-
Cited by 990 (7 self)
- Add to MetaCart
for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks. We also provide computational experiments on large collaboration networks, showing that in addition to their provable guarantees, our approximation algorithms significantly out-perform
Statistical phrase-based translation
, 2003
"... We propose a new phrase-based translation model and decoding algorithm that enables us to evaluate and compare several, previously proposed phrase-based translation models. Within our framework, we carry out a large number of experiments to understand better and explain why phrase-based models outpe ..."
Abstract
-
Cited by 944 (11 self)
- Add to MetaCart
outperform word-based models. Our empirical results, which hold for all examined language pairs, suggest that the highest levels of performance can be obtained through relatively simple means: heuristic learning of phrase translations from word-based alignments and lexical weighting of phrase translations
The R*-tree: an efficient and robust access method for points and rectangles
- INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1990
"... The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design the ..."
Abstract
-
Cited by 1262 (74 self)
- Add to MetaCart
the R*-tree which incorporates a combined optimization of area, margin and overlap of each enclosing rectangle in the directory. Using our standardized testbed in an exhaustive performance comparison, it turned out that the R*-tree clearly outperforms the existing R-tree variants. Guttman's linear
Fast Folding and Comparison of RNA Secondary Structures (The Vienna RNA Package)
"... Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and bas ..."
Abstract
-
Cited by 809 (117 self)
- Add to MetaCart
implementations of modified algorithms on parallel computers with distributed memory. Performance analysis carried out on an Intel Hypercube shows that parallel computing becomes gradually more and more efficient the longer the sequences are.
Time-Based Language Models
, 2003
"... We explore the relationship between time and relevance using TREC ad-hoc queries. A type of query is identified that favors very recent documents. We propose a time-based language model approach to retrieval for these queries. We show how time can be incorporated into both query-likelihood models an ..."
Abstract
-
Cited by 440 (36 self)
- Add to MetaCart
and relevance models. We carried out experiments to compare time-based language models to heuristic techniques for incorporating document recency in the ranking. Our results show that time-based models perform as well as or better than the best of the heuristic techniques.
Internet traffic engineering by optimizing OSPF weights
- in Proc. IEEE INFOCOM
, 2000
"... Abstract—Open Shortest Path First (OSPF) is the most commonly used intra-domain internet routing protocol. Traffic flow is routed along shortest paths, splitting flow at nodes where several outgoing links are on shortest paths to the destination. The weights of the links, and thereby the shortest pa ..."
Abstract
-
Cited by 403 (13 self)
- Add to MetaCart
resorted to a local search heuristic. Surprisingly it turned out that for the proposed AT&T WorldNet backbone, we found weight settings that performed
Model-based Feedback in the Language Modeling Approach to Information Retrieval
- In Proceedings of Tenth International Conference on Information and Knowledge Management
, 2001
"... The language modeling approach to retrieval has been shown to perform well empirically. One advantage of this new approach is its statistical foundations. However, feedback, as one important component in a retrieval system, has only been dealt with heuristically in this new retrieval approach: the o ..."
Abstract
-
Cited by 251 (24 self)
- Add to MetaCart
The language modeling approach to retrieval has been shown to perform well empirically. One advantage of this new approach is its statistical foundations. However, feedback, as one important component in a retrieval system, has only been dealt with heuristically in this new retrieval approach
Motion Planning in Dynamic Environments using Velocity Obstacles
- International Journal of Robotics Research
, 1998
"... Abstract!llis paper presents a new approach for rot)ot]notion planning in dynamic environ-ments, based on the concept of Velocity Obstacle.,4 velocity obstacle defines the set of robot velocities that would result in a collision between tlie robot and an obstacle mov-ing at a given velocity. The avo ..."
Abstract
-
Cited by 206 (6 self)
- Add to MetaCart
. The avoidance maneuver a { a specific time is thus computed by selecting robot’s velocities out of that set. ~’lle set [If all avoid inp, velocities is redllced to the dynamica]]y fcasib]e maneuvers by considering the robot’s acceleration constraints. This computation is re])eatecl at regular time intro vals
The History Heuristic and Alpha-Beta Search Enhancements in Practice
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1989
"... Many enhancements to the alpha-beta algorithm have been proposed to help reduce the size of minimax trees. A recent enhancement, the history heuristic, is described that improves the order in which branches are considered at interior nodes. A comprehensive set of experiments is reported which tries ..."
Abstract
-
Cited by 110 (20 self)
- Add to MetaCart
the combination that provides the greatest reduction in tree size. Results indicate that the history heuristic and transposition tables significantly out-perform other alpha-beta enhancements in application generated game trees. For trees up to depth 8, when taken together, they account for over 99
Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale Social Networks
"... Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influence under certain influence cascade models. The scalability of influence maximization is a key factor for enabling preval ..."
Abstract
-
Cited by 183 (14 self)
- Add to MetaCart
prevalent viral marketing in largescale online social networks. Prior solutions, such as the greedy algorithm of Kempe et al. (2003) and its improvements are slow and not scalable, while other heuristic algorithms do not provide consistently good performance on influence spreads. In this paper, we design a
Results 1 - 10
of
1,661
