Sciweavers

4767 search results - page 816 / 954
» Structures for Abstract Rewriting
Sort
View
131
Voted
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
15 years 17 days ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou
TOSEM
2010
159views more  TOSEM 2010»
15 years 17 days ago
Clone region descriptors: Representing and tracking duplication in source code
n the concept of abstract clone region descriptors (CRDs), which describe clone regions using a combination of their syntactic, structural, and lexical information. We present our ...
Ekwa Duala-Ekoko, Martin P. Robillard
123
Voted
UIC
2010
Springer
15 years 16 days ago
A Lattice-Theoretic Approach to Runtime Property Detection for Pervasive Context
Abstract. Runtime detection of contextual properties is one of the primary approaches to enabling context-awareness. Existing property detection schemes implicitly assume that cont...
Tingting Hua, Yu Huang 0002, Jiannong Cao, XianPin...
112
Voted
CORR
2010
Springer
114views Education» more  CORR 2010»
15 years 15 days ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
111
Voted
ASPDAC
2010
ACM
233views Hardware» more  ASPDAC 2010»
15 years 6 days ago
Computer-aided recoding for multi-core systems
- The design of embedded computing systems faces a serious productivity gap due to the increasing complexity of their hardware and software components. One solution to address this...
Rainer Dömer