Sciweavers

411 search results - page 73 / 83
» Efficient View Maintenance Using Version Numbers
Sort
View
IANDC
2008
114views more  IANDC 2008»
13 years 10 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
BMCBI
2005
159views more  BMCBI 2005»
13 years 9 months ago
Columba: an integrated database of proteins, structures, and annotations
Background: Structural and functional research often requires the computation of sets of protein structures based on certain properties of the proteins, such as sequence features,...
Silke Trißl, Kristian Rother, Heiko Mül...
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 10 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
ECP
1997
Springer
103views Robotics» more  ECP 1997»
14 years 2 months ago
Plan-Refinement Strategies and Search-Space Size
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
Reiko Tsuneto, Dana S. Nau, James A. Hendler
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 10 months ago
Randomized Lattice Decoding
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
Shuiyin Liu, Cong Ling, Damien Stehlé