Sciweavers

956 search results - page 24 / 192
» Slicing Objects Using System Dependence Graphs
Sort
View
EOR
2006
82views more  EOR 2006»
13 years 9 months ago
Flowshop scheduling research after five decades
: All information systems have to be protected. As the number of information objects and the number of users increase the task of information system's protection becomes more ...
Jatinder N. D. Gupta, Edward F. Stafford
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 4 months ago
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
Georg Moser, Andreas Schnabl
PAKDD
2009
ACM
135views Data Mining» more  PAKDD 2009»
14 years 4 months ago
On Mining Rating Dependencies in Online Collaborative Rating Networks
The trend of social information processing sees e-commerce and social web applications increasingly relying on user-generated content, such as rating, to determine the quality of o...
Hady Wirawan Lauw, Ee-Peng Lim, Ke Wang
DAGSTUHL
2006
13 years 11 months ago
Many-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...
WCRE
2008
IEEE
14 years 4 months ago
Analyzing the Actual Execution of a Large Software-Intensive System for Determining Dependencies
In this paper, we present a dynamic analysis approach to increase the understandability of a large softwareintensive system, more particularly to enable the identification of depe...
Trosky Boris Callo Arias, Paris Avgeriou, Pierre A...