Sciweavers

11151 search results - page 140 / 2231
» On the Complexity of Model Expansion
Sort
View
138
Voted
TCS
2008
15 years 4 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
NAR
2011
196views Computer Vision» more  NAR 2011»
14 years 7 months ago
UniPROBE, update 2011: expanded content and search tools in the online database of protein-binding microarray data on protein-DN
The Universal PBM Resource for OligonucleotideBinding Evaluation (UniPROBE) database is a centralized repository of information on the DNAbinding preferences of proteins as determ...
Kimberly Robasky, Martha L. Bulyk
125
Voted
VLDB
1989
ACM
114views Database» more  VLDB 1989»
15 years 8 months ago
Extending the Relational Algebra to Capture Complex Objects
An important direction in database research for non-standard applications (e.g. engineering or design applications) deals with adequate support for complex objects. Without doubt,...
Bernhard Mitschang
ICIP
2008
IEEE
16 years 6 months ago
A scalable complexity specification for video applications
We propose a new complexity modeling framework for multimedia tasks. We characterize the traffic with five parameters that together we designate as a task's complexity specif...
Nicholas Mastronarde, Mihaela van der Schaar
HPCC
2007
Springer
15 years 10 months ago
A Complex Network-Based Approach for Job Scheduling in Grid Environments
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
Renato Porfirio Ishii, Rodrigo Fernandes de Mello,...