Sciweavers

3731 search results - page 133 / 747
» Reduct Generation in Information Systems
Sort
View
JITECH
2010
116views more  JITECH 2010»
13 years 8 months ago
Design theory for dynamic complexity in information infrastructures: the case of building internet
We propose a design theory that tackles dynamic complexity in the design for Information Infrastructures (IIs) defined as a shared, open, heterogeneous and evolving socio-technica...
Ole Hanseth, Kalle Lyytinen
IV
2008
IEEE
99views Visualization» more  IV 2008»
14 years 4 months ago
Visualization Enhanced Semantic Wikis for Patent Information
In this paper we present a new approach for using semantic wikis for collaborative patent search and annotation. We describe an extension that allows integrating interactive visua...
Mark Giereth, Thomas Ertl
CEC
2010
IEEE
13 years 5 months ago
Parameter estimation with term-wise decomposition in biochemical network GMA models by hybrid regularized Least Squares-Particle
High-throughput analytical techniques such as nuclear magnetic resonance, protein kinase phosphorylation, and mass spectroscopic methods generate time dense profiles of metabolites...
Prospero C. Naval, Luis G. Sison, Eduardo R. Mendo...
WSC
1997
13 years 11 months ago
Efficient Simulation of Multiclass Queueing Networks
General multiclass queueing systems are extremely difficult to analyze. A great deal of effort has been devoted to examining the question of stability and performance of such net...
Shane G. Henderson, Sean P. Meyn
CC
2010
Springer
112views System Software» more  CC 2010»
13 years 4 months ago
Random Cnf's are Hard for the Polynomial Calculus
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
Eli Ben-Sasson, Russell Impagliazzo