Sciweavers

557 search results - page 111 / 112
» A Type-Coercion Problem in Computer Algebra
Sort
View
ECCV
2010
Springer
14 years 9 days ago
 5D Motion Subspaces for Planar Motions
In practice, rigid objects often move on a plane. The object then rotates around a fixed axis and translates in a plane orthogonal to this axis. For a concrete example, think of a ...
Roland Angst, Marc Pollefeys
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
13 years 11 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
CIDR
2003
106views Algorithms» more  CIDR 2003»
13 years 9 months ago
Speculative Query Processing
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
Neoklis Polyzotis, Yannis E. Ioannidis
BMCBI
2008
242views more  BMCBI 2008»
13 years 7 months ago
New time-scale criteria for model simplification of bio-reaction systems
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
Junwon Choi, Kyung-won Yang, Tai-yong Lee, Sang Yu...
CGF
2006
183views more  CGF 2006»
13 years 7 months ago
Cross Dissolve Without Cross Fade: Preserving Contrast, Color and Salience in Image Compositing
Linear interpolation is the standard image blending method used in image compositing. By averaging in the dynamic range, it reduces contrast and visibly degrades the quality of co...
Mark Grundland, Rahul Vohra, Gareth P. Williams, N...