Sciweavers

1425 search results - page 212 / 285
» Beyond Dependency Graphs
Sort
View
IEEEARES
2010
IEEE
14 years 3 months ago
FedWare: Middleware Services to Cope with Information Consistency in Federated Identity Management
—Collaborations by the use of inter-organizational business processes can help companies to achieve a competitive edge over competing businesses. Typically, these collaborations ...
Thorsten Höllrigl, Jochen Dinger, Hannes Hart...
IISWC
2009
IEEE
14 years 2 months ago
Experimental evaluation of N-tier systems: Observation and analysis of multi-bottlenecks
In many areas such as e-commerce, mission-critical N-tier applications have grown increasingly complex. They are characterized by non-stationary workloads (e.g., peak load several...
Simon Malkowski, Markus Hedwig, Calton Pu
LAWEB
2009
IEEE
14 years 2 months ago
Promoting Creative Design through Toolkits
—Computer science academics and professionals typically consider their contributions in terms of the algorithms, applications, and techniques that they develop. Yet equally impor...
Saul Greenberg
COCO
2009
Springer
78views Algorithms» more  COCO 2009»
14 years 2 months ago
Fixed-Polynomial Size Circuit Bounds
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
Lance Fortnow, Rahul Santhanam, Ryan Williams
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 2 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...