Sciweavers

4781 search results - page 373 / 957
» Complexity at large
Sort
View
124
Voted
WSFM
2007
Springer
15 years 10 months ago
Towards a Theory of Web Service Choreographies
A fundamental promise of service oriented architecture (SOA) lies in the ease of integrating sharable information, processes, and other resources through interactions among the sha...
Jianwen Su, Tevfik Bultan, Xiang Fu, Xiangpeng Zha...
142
Voted
VLDB
1993
ACM
121views Database» more  VLDB 1993»
15 years 8 months ago
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
Dimitris Plexousakis
125
Voted
ASPDAC
2007
ACM
99views Hardware» more  ASPDAC 2007»
15 years 8 months ago
DpRouter: A Fast and Accurate Dynamic-Pattern-Based Global Routing Algorithm
Abstract - This paper presents a fast and accurate global routing algorithm, DpRouter, based on two efficient techniques: (1) dynamic pattern routing (Dpr), and (2) segment movemen...
Zhen Cao, Tong Jing, Jinjun Xiong, Yu Hu, Lei He, ...
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
15 years 8 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt
BDA
2007
15 years 6 months ago
Hyperplane Queries in a Feature-Space M-tree for Speeding up Active Learning
In content-based retrieval, relevance feedback (RF) is a noticeable method for reducing the “semantic gap” between the low-level features describing the content and the usually...
Michel Crucianu, Daniel Estevez, Vincent Oria, Jea...