Sciweavers

244 search results - page 26 / 49
» The Case for Efficient File Access Pattern Modeling
Sort
View
POPL
2006
ACM
14 years 7 months ago
A hierarchical model of data locality
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yu...
FODO
1998
Springer
242views Algorithms» more  FODO 1998»
13 years 11 months ago
Optimizing OID Indexing Cost in Temporal Object-Oriented Database Systems
In object-oriented database systems (OODB) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal ...
Kjetil Nørvåg, Kjell Bratbergsengen
CASES
2007
ACM
13 years 11 months ago
Rethinking custom ISE identification: a new processor-agnostic method
The last decade has witnessed the emergence of the Application Specific Instruction-set Processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user...
Ajay K. Verma, Philip Brisk, Paolo Ienne
COMPSAC
2008
IEEE
14 years 1 months ago
Ontology Model-Based Static Analysis on Java Programs
1 Typical enterprise and military software systems consist of millions of lines of code with complicated dependence on library abstractions. Manually debugging these codes imposes ...
Lian Yu, Jun Zhou, Yue Yi, Ping Li, Qianxiang Wang
BMCBI
2010
154views more  BMCBI 2010»
13 years 7 months ago
Binary image representation of a ligand binding site: its application to efficient sampling of a conformational ensemble
Background: Modelling the ligand binding site of a protein is an important component of understanding proteinligand interactions and is being actively studied. Even if the side ch...
Edon Sung, Sangsoo Kim, Whanchul Shin