Sciweavers

1477 search results - page 74 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
NLP
2000
15 years 5 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
GPC
2010
Springer
15 years 5 months ago
Actor Garbage Collection Using Vertex-Preserving Actor-to-Object Graph Transformations
Abstract. Large-scale distributed computing applications require concurrent programming models that support modular and compositional software development. The actor model supports...
Wei-Jen Wang, Carlos A. Varela, Fu-Hau Hsu, Cheng-...
ECOOP
2001
Springer
15 years 6 months ago
Feature Interaction and Composition Problems in Software Product Lines
Features are essential characteristic of applications within a product line. Features organized in different kinds of diagrams containing hierarchies of feature trees are closely ...
Silva Robak, Bogdan Franczyk
ICSM
2009
IEEE
15 years 8 months ago
A combinatorial approach to building navigation graphs for dynamic web applications
Modeling the navigation structure of a dynamic web application is a challenging task because of the presence of dynamic pages. In particular, there are two problems to be dealt wi...
Wenhua Wang, Yu Lei, Sreedevi Sampath, Raghu Kacke...
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
16 years 1 months ago
Anonymizing Weighted Social Network Graphs
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
Sudipto Das, Ömer Egecioglu, Amr El Abbadi