Sciweavers

2721 search results - page 153 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
KBSE
2005
IEEE
15 years 3 months ago
On dynamic feature location
Feature location aims at locating pieces of code that implement a given set of features (requirements). It is a necessary first step in every program comprehension and maintenanc...
Rainer Koschke, Jochen Quante
DOCENG
2007
ACM
15 years 1 months ago
Logical document conversion: combining functional and formal knowledge
We present in this paper a method for document layout analysis based on identifying the function of document elements (what they do). This approach is orthogonal and complementary...
Hervé Déjean, Jean-Luc Meunier
CIKM
2009
Springer
15 years 1 months ago
Building domain-oriented sentiment lexicon by improved information bottleneck
This paper describes an adapted information bottleneck approach for construction of domain-oriented sentiment lexicon. The basic idea is to use three kinds of relationships (WWint...
Weifu Du, Songbo Tan
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
15 years 10 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
ICDE
2011
IEEE
215views Database» more  ICDE 2011»
14 years 1 months ago
Top-k keyword search over probabilistic XML data
—Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang