Sciweavers

186 search results - page 36 / 38
» Speeding up algorithms on compressed web graphs
Sort
View
RECOMB
2005
Springer
14 years 7 months ago
Rapid Protein Side-Chain Packing via Tree Decomposition
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
Jinbo Xu
AAAI
2006
13 years 8 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
GIS
2006
ACM
14 years 8 months ago
Efficient GML-native processors for web-based GIS: techniques and tools
Geography Markup Language (GML) is an XML-based language for the markup, storage, and exchange of geospatial data. It provides a rich geospatial vocabulary and allows flexible doc...
Chia-Hsin Huang, Tyng-Ruey Chuang, Dong-Po Deng, H...
FCCM
1997
IEEE
199views VLSI» more  FCCM 1997»
13 years 11 months ago
The RAW benchmark suite: computation structures for general purpose computing
The RAW benchmark suite consists of twelve programs designed to facilitate comparing, validating, and improving reconfigurable computing systems. These benchmarks run the gamut o...
Jonathan Babb, Matthew Frank, Victor Lee, Elliot W...
PODS
2002
ACM
167views Database» more  PODS 2002»
14 years 7 months ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon