Sciweavers

2754 search results - page 161 / 551
» Distributed Weighted Matching
Sort
View
111
Voted
EDOC
2009
IEEE
15 years 4 months ago
Aligning Business Process Models
This paper studies the following problem: given a pair of business process models, determine which elements in one model are related to which elements in the other model. This prob...
Remco M. Dijkman, Marlon Dumas, Luciano Garc&iacut...
100
Voted
KDD
2004
ACM
146views Data Mining» more  KDD 2004»
16 years 1 months ago
Using Hyperlink Features to Personalize Web Search
Personalized search has gained great popularity to improve search effectiveness in recent years. The objective of personalized search is to provide users with information tailored ...
Mehmet S. Aktas, Mehmet A. Nacar, Filippo Menczer
154
Voted
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
13 years 3 months ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...
91
Voted
EUROCRYPT
2003
Springer
15 years 6 months ago
Predicting the Shrinking Generator with Fixed Connections
We propose a novel distinguishing attack on the shrinking generator with known feedback polynomial for the generating LFSR. The attack can e.g. reliably distinguish a shrinking gen...
Patrik Ekdahl, Willi Meier, Thomas Johansson
133
Voted
DAM
2002
67views more  DAM 2002»
15 years 18 days ago
Optimal arrangement of data in a tree directory
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
Malwina J. Luczak, Steven D. Noble