Sciweavers

7123 search results - page 272 / 1425
» The Ordered Set of Rough Sets
Sort
View
CW
2002
IEEE
15 years 11 months ago
Direct Segmentation for Reverse Engineering
In Reverse Engineering a physical object is digitally reconstructed from a set of boundary points. In the segmentation phase these points are grouped into subsets to facilitate co...
Marek Vanco, Guido Brunnett
ICSM
1994
IEEE
15 years 10 months ago
A Change Analysis Process to Characterize Software Maintenance Projects
In order to improve software maintenance processes, we need to be able to first characterize and assess them. This task needs to be performed in depth and with objectivity since t...
Lionel C. Briand, Victor R. Basili, Yong-Mi Kim, D...
CCCG
2010
15 years 8 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 7 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
SAC
2010
ACM
16 years 1 months ago
Adaptive fuzzy-valued service selection
Service composition concerns both integration of heterogeneous distributed applications and dynamic selection of services. QoS-aware selection enables a service requester with cer...
Davide Bacciu, Maria Grazia Buscemi, Lusine Mkrtch...