Sciweavers

657 search results - page 21 / 132
» A performance study of RSVP with proposed extensions
Sort
View
STTT
2010
132views more  STTT 2010»
13 years 6 months ago
Evaluation of Kermeta for solving graph-based problems
Kermeta is a meta-language for specifying the structure and behavior of graphs of interconnected objects called models. In this paper, we show that Kermeta is relatively suitable f...
Naouel Moha, Sagar Sen, Cyril Faucher, Olivier Bar...
ACL
2012
11 years 10 months ago
A Graph-based Cross-lingual Projection Approach for Weakly Supervised Relation Extraction
Although researchers have conducted extensive studies on relation extraction in the last decade, supervised approaches are still limited because they require large amounts of trai...
Seokhwan Kim, Gary Geunbae Lee
AAIM
2006
Springer
222views Algorithms» more  AAIM 2006»
14 years 1 months ago
Connected Set Cover Problem and Its Applications
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
Tianping Shuai, Xiao-Dong Hu
DEXAW
2002
IEEE
127views Database» more  DEXAW 2002»
14 years 24 days ago
Enhanced Multi-Version Data Broadcast Schemes for Time-Constrained Mobile Computing Systems
In this paper, we study the data dissemination problem in time-constrained mobile computing systems (TCMCS) in which maximizing data currency (minimizing staleness) and meeting tr...
Hei-Wing Leung, Joe Chun-Hung Yuen, Kam-yiu Lam, E...
ICDM
2003
IEEE
141views Data Mining» more  ICDM 2003»
14 years 1 months ago
TSP: Mining Top-K Closed Sequential Patterns
Sequential pattern mining has been studied extensively in data mining community. Most previous studies require the specification of a minimum support threshold to perform the min...
Petre Tzvetkov, Xifeng Yan, Jiawei Han