Sciweavers

2745 search results - page 516 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
144
Voted
DEBS
2008
ACM
15 years 5 months ago
Replica placement for high availability in distributed stream processing systems
A significant number of emerging on-line data analysis applications require the processing of data streams, large amounts of data that get updated continuously, to generate output...
Thomas Repantis, Vana Kalogeraki
150
Voted
BMCBI
2004
208views more  BMCBI 2004»
15 years 3 months ago
Using 3D Hidden Markov Models that explicitly represent spatial coordinates to model and compare protein structures
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
Vadim Alexandrov, Mark Gerstein
CVPR
2000
IEEE
16 years 5 months ago
High Dynamic Range Imaging: Spatially Varying Pixel Exposures
While real scenes produce a wide range of brightness variations, vision systems use low dynamic range image detectors that typically provide 8 bits of brightness data at each pixe...
Shree K. Nayar, Tomoo Mitsunaga
158
Voted
ICCS
2009
Springer
15 years 10 months ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...
144
Voted
SIGGRAPH
1994
ACM
15 years 7 months ago
Zippered polygon meshes from range images
Range imaging offers an inexpensive and accurate means for digitizing the shape of three-dimensional objects. Because most objects self occlude, no single range image suffices to ...
Greg Turk, Marc Levoy