Sciweavers

811 search results - page 45 / 163
» Avoiding Approximate Squares
Sort
View
LATIN
2004
Springer
14 years 29 days ago
Combinatorial Problems on Strings with Applications to Protein Folding
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
Alantha Newman, Matthias Ruhl
PG
2007
IEEE
14 years 1 months ago
QAS: Real-Time Quadratic Approximation of Subdivision Surfaces
We introduce QAS, an efficient quadratic approximation of subdivision surfaces which offers a very close appearance compared to the true subdivision surface but avoids recursion,...
Tamy Boubekeur, Christophe Schlick
ICDM
2007
IEEE
169views Data Mining» more  ICDM 2007»
13 years 11 months ago
Efficient Discovery of Frequent Approximate Sequential Patterns
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
ICDE
2004
IEEE
140views Database» more  ICDE 2004»
14 years 9 months ago
Approximate Aggregation Techniques for Sensor Databases
In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collec...
Jeffrey Considine, Feifei Li, George Kollios, John...
EMSOFT
2004
Springer
14 years 1 months ago
Conservative approximations for heterogeneous design
Embedded systems are electronic devices that function in the context of a real environment, by sensing and reacting to a set of stimuli. Because of their close interaction with th...
Roberto Passerone, Jerry R. Burch, Alberto L. Sang...